Finding roots of univariate polynomials.
Numeric vector representing a polynomial.
starting value for newtonHorner().
maximum number of iterations; default 100.
absolute tolerance; default
newtonRahson, except that the computation of the
derivative is done through the Horner scheme in parallel with computing
the value of the polynomial. This makes the algorithm significantly
Return a list with components
the function value at the found root,
iter, the number of iterations
root, and the estimated precision
The estimated precision is given as the difference to the last solution before stop.
Quarteroni, A., R. Sacco, and F. Saleri (2007). Numerical Mathematics. Second Edition, Springer-Verlag, Berlin Heidelberg.
1 2 3 4 5 6 7 8 9 10 11 12 13
x0 = 1 x0 = 2 x0 = 3
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.