Numerical recipes

174 Chapter 5. Evaluation of Functions
or
p=c[j=n];
dp=0.0;
while (j>0) {dp=dp*x+p; p=p*x+c[--j];}
which yields the polynomial as p and its derivative as dp.
The above trick, which is basically synthetic division [1,2], generalizes to the
evaluation of the polynomial and nd of its derivatives simultaneously:
void ddpoly(float c[], int nc, float x, float pd[], int nd)
Given the nc+1 coefficients of a polynomial of degree nc as an array c[0..nc] with c[0]
being the constant term, and given a value x, and given a value nd>1, this routine returns the
polynomial evaluated at x as pd[0] and nd derivatives as pd[1..nd].
{
int nnd,j,i;
float cnst=1.0;
}
pd[0]=c[nc];
for (j=1;j=0;i--) {
nnd=(nd < (nc-i) ? nd : nc-i);
for (j=nnd;j>=1;j--)
pd[j]=pd[j]*x+pd[j-1];
pd[0]=pd[0]*x+c[i];
}
for (i=2;i3 can be evaluated in fewer than n multiplications, at least if you are willing
to precompute some auxiliary coefficients and, in some cases, do an extra addition.
For example, the polynomial
P (x) =a0 + a1x + a2x 2 + a3x 3 + a4x 4
(5.3.1)
where a4 > 0, can be evaluated with 3 multiplications and 5 additions as follows:
P (x) =[(Ax + B) 2 + Ax + C][(Ax + B) 2 + D]+E (5.3.2)
where A, B, C, D, and E are to be precomputed by
A =(a4) 1/4
B = a3 − A 3
4A 3
D =3B 2 +8B 3 + a1A − 2a2B
A 2
C = a2
A 2 − 2B − 6B2 − D
E = a0 − B 4 − B 2 (C + D) − CD
(5.3.3)
Sample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)
Copyright (C) 1988-1992 by Cambridge University Press. Programs Copyright (C) 1988-1992 by Numerical Recipes Software.
Permission is granted for internet users to make one paper copy for their own personal use. Further reproduction, or any copying of machinereadable
files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, visit website
http://www.nr.com or call 1-800-872-7423 (North America only), or send email to directcustserv@cambridge.org (outside North America).