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.Template:Refn

Algorithm

Preliminaries

Consider an arbitrary polynomial $p\in ℝ[x]$ of degree $n$. Assume that $n\ge 3$. Define $m$ such that: if $n$ is odd then $n=2m+1$, and if $n$ is even then $n=2m+2$.

Unless otherwise stated, all variables in this article represent either real numbers or univariate polynomials with real coefficients. All operations in this article are done over $ℝ$.

Again, the goal is to create an algorithm that returns $p(x)$ given any $x$. The algorithm is allowed to depend on the polynomial $p$ itself, since its coefficients are known in advance.

Overview

Key idea

Using polynomial long division, we can write

$$p(x)=q(x)\cdot (x^2-\alpha )+(\beta x+\gamma ),$$

where $x^2-\alpha$ is the divisor. Picking a value for $\alpha$ fixes both the quotient $q$ and the coefficients in the remainder $\beta$ and $\gamma$. The key idea is to cleverly choose $\alpha$ such that $\beta =0$, so that

$$p(x)=q(x)\cdot (x^2-\alpha )+\gamma .$$

This way, no operations are needed to compute the remainder polynomial, since it's just a constant. We apply this procedure recursively to $q$, expressing

$$p(x)=((q(x)\cdot (x^2-{\alpha }_m)+{\gamma }_m)\cdots )\cdot (x^2-{\alpha }_1)+{\gamma }_1.$$

After $m$ recursive calls, the quotient $q$ is either a linear or a quadratic polynomial. In this base case, the polynomial can be evaluated with (say) Horner's method.

"Preconditioning"

For arbitrary $p$, it may not be possible to force $\beta =0$ at every step of the recursion. Consider the polynomials $p^e$ and $p^o$ with coefficients taken from the even and odd terms of $p$ respectively, so that

$$p(x)=p^e(x^2)+x\cdot p^o(x^2).$$

If every root of $p^o$ is real, then it is possible to write $p$ in the form given above. Each ${\alpha }_i$ is a different root of $p^o$, counting multiple roots as distinct. Furthermore, if at least $n-1$ roots of $p$ lie in one half of the complex plane, then every root of $p^o$ is real.

Ultimately, it may be necessary to "precondition" $p$ by shifting it Template:-- by setting $p(x)\leftarrow p(x+t)$ for some $t$ Template:-- to endow it with the structure that most of its roots lie in one half of the complex plane. At runtime, this shift has to be "undone" by first setting $x\leftarrow x-t$.

Preprocessing step

The following algorithm is run once for a given polynomial $p$. At this point, the values of $x$ that $p$ will be evaluated on are not known.

• Let $r_1,\cdots ,r_n\in ℂ$ be the complex roots of $p$, sorted in descending order by real part
• Choose any $t\ge \text{Re}(r_2)$
• Set $p\leftarrow p(x+t)$

---

• Let $p^e$ and $p^o$ be the polynomials such that $p(x)=p^e(x^2)+x\cdot p^o(x^2)$
• Let ${\alpha }_1,\cdots {\alpha }_m\in ℝ$ be the roots of $p^o$. All of its roots will be real.

---

• Initialize $q\leftarrow p$
• For $i\leftarrow 1,\cdots ,m$:
  • Divide $q$ by $x^2-{\alpha }_i$ to get quotient $q^{\prime }\in ℝ[x]$ and remainder ${\gamma }_i\in ℝ$. The remainder will be a constant polynomial Template:-- a number.
  • Set $q\leftarrow q^{\prime }$

---

• Output: The derived values $t$, ${\alpha }_1,\cdots ,{\alpha }_m$, and ${\gamma }_1,\cdots ,{\gamma }_m$; as well as the base-case polynomial $q$

Better choice of t

While any $t\ge \text{Re}(r_2)$ can work, it is possible to remove one addition during evaluation if $t$ is also chosen such that two roots of $p(x+t)$ are symmetric about the origin. In that case, ${\alpha }_1$ can be chosen such that the shifted polynomial has a factor of $x^2-{\alpha }_1$, so ${\gamma }_1=0$. It is always possible to find such a $t$.

One possible algorithm for choosing $t$ is:Template:Citation needed

• If $r_1\in ℝ$:
  • If $r_2\in ℝ$: $t=\frac{1}{2}(r_1+r_2)$
  • Else: $t=\text{Re}(r_2)$
• Else: $t=\text{Re}(r_1)$

Evaluation step

The following algorithm evaluates $p$ at some, now known, point $x$.

• Set $x\leftarrow x-t$
• Let $s=x^2$. Compute this once so it can be reused.

---

• Compute $y\leftarrow q(x)$ using Horner's method
• For $i\leftarrow m,\cdots ,2,1$:
  • Let $y\leftarrow y\cdot (s-{\alpha }_i)+{\gamma }_i$
• Output: $y$

Assuming $t$ is chosen optimally, ${\gamma }_1=0$. So, the final iteration of the loop can instead run

$$y\leftarrow y\cdot (s-{\alpha }_i),$$

saving an addition.

Analysis

In total, evaluation using the Knuth–Eve algorithm for a polynomial of degree $n$ requires $n$ additions and $\lfloor n/2\rfloor +2$ multiplications, assuming $t$ is chosen optimally.

No algorithm to evaluate a given polynomial of degree $n$ can use fewer than $n$ additions or fewer than $\lceil n/2\rceil$ multiplications during evaluation. This result assumes only addition and multiplication are allowed during both preprocessing and evaluation.Template:Better source needed

The Knuth–Eve algorithm is not well-conditioned.