Knuth–Eve algorithm
In computer science, the Knuth–Eve algorithm is an algorithm for polynomial evaluation. It preprocesses the coefficients of the polynomial to reduce the number of multiplications required at runtime. Ideas used in the algorithm were originally proposed by Donald Knuth in 1962. His procedure opportunistically exploits structure in the polynomial being evaluated. In 1964, James Eve determined for which polynomials this structure exists, and gave a simple method of "preconditioning" polynomials (explained below) to endow them with that structure.
Wikipedia contributors, "Knuth–Eve algorithm", Wikipedia, revision 1371042535, retrieved 20 November 2026, source, CC BY-SA 4.0.