The document describes an algorithm for adapting Newton's method to find roots of polynomials. It presents the steps of the algorithm, which take in the polynomial coefficients, an initial guess, and other parameters and iteratively find better approximations to the roots. It then shows an implementation of the algorithm in Mathematica. Finally, it provides 6 examples of polynomials and applies Newton's method as implemented in Mathematica to find the real roots of each polynomial.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
68 views16 pages
NMpolynom 2
The document describes an algorithm for adapting Newton's method to find roots of polynomials. It presents the steps of the algorithm, which take in the polynomial coefficients, an initial guess, and other parameters and iteratively find better approximations to the roots. It then shows an implementation of the algorithm in Mathematica. Finally, it provides 6 examples of polynomials and applies Newton's method as implemented in Mathematica to find the real roots of each polynomial.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16
Adaption of Newton’s method to
polynomial rootfinding
E. Cojuhari Mathematics in Computer Sciences
Algorithm
Polynew (a, n, x0 ,, itmax, root, b, ier)
1 Remark: a is a vector of coefficients, itmax the maximum number of iterates to be computed, b the vector of coefficients for the deflated polynomial, and ier an error indicator. 2 itnum := 1 3 z := x0 , bn := c := an 4 For k = n − 1, . . . , 1, bk := ak + z · bk +1 c := bk + z · c 5 b0 := a0 + z · b1 6 If c = 0, ier := 2 and exit. 7 x1 := x0 − b0 /c 8 If |x1 − x0 | ≤ , then ier := 0, root := x1 , and exit. 9 If itnum = itmax, then ier := 1 and exit. 10 Otherwise, itnum := itnum + 1, x0 := x1 , and go to step 3.