EVALUATING A POLYNOMIAL

Transcription

1 EVALUATING A POLYNOMIAL Consider having a polynomial p(x) =a 0 + a 1 x + a 2 x a n x n which you need to evaluate for many values of x. How do you evaluate it? This may seem a strange question, but the answer is not as obvious as you might think. The standard way, written in a loose algorithmic format: poly = a 0 for j =1:n poly = poly + a j x j end

2 To compare the costs of different numerical methods, we do an operations count, and then we compare these for the competing methods. Above, the counts are as follows: additions : n n(n +1) multiplications : n = 2 This assumes each term a j x j is computed independently of the remaining terms in the polynomial.

3 Next, do the terms x j recursively: x j = x x j 1 Then to compute n x 2,x 3,...,x no will cost n 1multiplications. Our algorithm becomes poly = a 0 + a 1 x power = x for j =2:n power = x power poly = poly + a j power end The total operations cost is additions : n multiplications : n + n 1=2n 1 When n is evenly moderately large, this is much less than for the first method of evaluating p(x). For example, with n =20,thefirst method has 210 multiplications, whereas the second has 39 multiplications.

4 We now considered nested multiplication. As examples of particular degrees, write n =2: p(x) =a 0 + x(a 1 + a 2 x) n =3: p(x) =a 0 + x (a 1 + x (a 2 + a 3 x)) n =4: p(x) =a 0 + x (a 1 + x (a 2 + x (a 3 + a 4 x))) These contain, respectively, 2, 3, and 4 multiplications. This is less than the preceding method, which would have need 3, 5, and 7 multiplications, respectively. For the general case, write p(x) =a 0 +x (a 1 + x (a x (a n 1 + a n x) )) This requires n multiplications, which is only about half that for the preceding method. For an algorithm, write poly = a n for j = n 1: 1 :0 poly = a j + x poly end With all three methods, the number of additions is n; but the number of multiplications can be dramatically different for large values of n.

5 NESTED MULTIPLICATION Imagine we are evaluating the polynomial p(x) =a 0 + a 1 x + a 2 x a n x n at a point x = z. Thus with nested multiplication p(z) =a 0 +z (a 1 + z (a z (a n 1 + a n z) )) We can write this as the following sequence of operations: b n = a n b n 1 = a n 1 + zb n b n 2 =. a n 2 + zb n 1 b 0 = a 0 + zb 1 The quantities b n 1,..., b 0 are simply the quantities in parentheses, starting from the inner most and working outward.

6 Introduce Claim: q(x) =b 1 + b 2 x + b 3 x b n x n 1 p(x) =b 0 +(x z)q(x) ( ) Proof: Simply expand b 0 +(x z) ³ b 1 + b 2 x + b 3 x b n x n 1 and use the fact that zb j = b j 1 a j 1, j =1,...,n With this result (*), we have p(x) x z = b 0 x z + q(x) Thus q(x) is the quotient when dividing p(x) byx z, and b 0 is the remainder.

7 If z is a zero of p(x), then b 0 =0;andthen p(x) =(x z)q(x) For the remaining roots of p(x), we can concentrate on finding those of q(x). In rootfinding for polynomials, this process of reducing the size of the problem is called deflation. Another consequence of (*) is the following. Form the derivative of (*) with respect to x, obtaining p 0 (x) = (x z)q 0 (x)+q(x) p 0 (z) = q(z) Thus to evaluate p(x)andp 0 (x) simultaneously at x = z, we can use nested multiplication for p(z) and we can use the intermediate steps of this to also evaluate p 0 (z). This is useful when doing rootfinding problems for polynomials by means of Newton s method.

8 APPROXIMATING SF(x) Define SF(x) = 1 Z x sin t dt, x 6= 0 x 0 t We use Taylor polynomials to approximate this function, to obtain a way to compute it with accuracy and simplicity. 1.0 y x

9 As an example, begin with the degree 3 Taylor approximation to sin t, expanded about t =0: sin t = t 1 6 t t5 cos c t with c t between 0 and t. Then 1 x Z x 0 Z x 0 sin t = 1 1 t 6 t t4 cos c t Z sin t x t dt = t t4 cos c t dt = x 1 18 x3 + 1 Z x t4 cos c t dt sin t t dt = x2 + R 2 (x) R 2 (x) = x xz 0 t 4 cos c t dt How large is the error in the approximation SF(x) x2

10 on the interval [ 1, 1]? Since cos c t 1, we have for x>0that 0 R 2 (x) 1 Z 1 x 120x 0 t4 dt = x4 andthesameresultcanbeshownforx<0. Then for x 1, we have 0 R 2 (x) Toobtainamoreaccurateapproximation,wecanproceed exactly as above, but simply use a higher degree approximation to sin t.

11 In the book we consider finding a Taylor polynomial approximation to SF(x) with its error satisfying R 8 (x) , x 1 A Matlab program, plot sint.m, implementing this approximation is given in the text and in the class account. The one in the class account includes the needed additional functions sint tay.m and poly even.m.

12 BeginwithaTaylorseriesforsint, sin t = t t3 3! + t5 5! +( 1)n 1 t 2n 1 (2n 1)! t2n+1 +( 1) n (2n +1)! cos(c t) with c t between 0 and t. Thenwrite Sint x = 1 x Z " x 0 1 t2 3! + t4 t 2n 2 +( 1) n 1 (2n 1)! =1 x2 3!3 + x4 5!5 x 2n 2 5! # dt + R 2n 2 (x) +( 1) n 1 (2n 1)!(2n 1) + R 2n 2(x) R 2n 2 (x) = 1 x Z x 0 ( 1)n t 2n (2n +1)! cos(c t) dt

13 Z x R 2n 2 (x) = 1 t 2n x 0 ( 1)n (2n +1)! cos(c t) dt To simplify matters, let x>0. Since cos(c t ) 1, Z x R 2n 2 (x) 1 t 2n x 0 (2n +1)! dt = x 2n (2n +1)!(2n +1) It is easy to see that this bound is also valid for x<0. As required, choose the degree so that From the error bound, R 2n 2 (x) max x 1 R 2n 2(x) 1 (2n + 1)!(2n +1) Choose n so that this upper bound is itself bounded by Thisistrueif2n +1 11, i.e. n 5.

14 The polynomial is p(x) =1 x2 3!3 + x4 5!5 x6 7!7 + x8 9!9, 1 x 1 and SF(x) p(x) , x 1 To evaluate it efficiently, we set u = x 2 and evaluate g(u) =1 u 18 + u2 600 u u After the evaluation of the coefficients (done once), the total number of arithmetic evaluations is 4 additions and 5 multiplications to evaluate p(x) foreach value of x.