Multiple root finder algorithm for Legendre and Chebyshev polynomials via Newton's method

MaRDI QIDQ3499385zbMATH OpenFDO

Authors Jorge Sosa-Pedroza, J. López-Bonilla, Víctor Barrera-Figueroa

Publication date 29 May 2008

Full work available at URL https://eudml.org/doc/128831

zbMATH Keywords

Legendre polynomialsChebyshev polynomialsNewton's methodmultiple root finder algorithm

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical computation of solutions to single equations (65H05)

Recommendations

• Newton's method in practice: finding all roots of polynomials of degree one million efficiently
• scientific article; zbMATH DE number 6824981
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
• On a modification of Chebyshev's method
• Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

Cited in

(1)

• Rootfinding through global Newton iteration and Chebyshev polynomials for the amplitude of an electronic oscillator

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Multiple root finder algorithm for Legendre and Chebyshev polynomials via Newton's method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499385)