Computing real roots of a polynomial in Chebyshev series form through subdivision

Applied Numerical Mathematics

Volumn 56, Issue 8, 2006, Pages 1077-1091

  Boyd, John P ^a  

^a Medical Computing Laboratory   (United States)

Author keywords

Chebyshev polynomials; Rootfinding

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; INTERPOLATION; NUMERICAL METHODS; POLYNOMIALS; ROBUSTNESS (CONTROL SYSTEMS);

CHEBYSHEV POLYNOMIALS; COMPANION MATRIX METHODS; ROOTFINDING; SUBDIVISIONS;

CHEBYSHEV APPROXIMATION;

EID: 33744519285     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2005.09.007     Document Type: Article

References (19)

1. Alpert B.A., and Rokhlin V. A fast algorithm for the evaluation of Legendre expansions. SIAM J. Sci. Comput. 12 (1991) 158-179
2. Battles Z., and Trefethen L.N. An extension of Matlab to continuous functions and operators. SIAM J. Sci. Comput. 25 (2004) 1743-1770
3. Bender C.M., and Orszag S.A. Advanced Mathematical Methods for Scientists and Engineers (1978), McGraw-Hill, New York 594 pp
4. Booth A.D. Numerical Methods (1955), Butterworths Scientific Publications, London
5. Boyd J.P. A Chebyshev polynomial interval-searching method ("Lanczos economization") for solving a nonlinear equation with application to the nonlinear eigenvalue problem. J. Comput. Phys. 118 (1995) 1-8
6. Boyd J.P. Chebyshev and Fourier Spectral Methods (2001), Dover, New York 688 pp
7. Boyd J.P. Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM J. Numer. Anal. 40 (2002) 1666-1682
8. Boyd J.P. A review of high-order methods for incompressible fluid flow by M.O. Deville, P.F. Fischer and E.H. Mund. SIAM Rev. 46 (2004) 151-157
9. J.P. Boyd, Computing the zeros of a Fourier series or trigonometric polynomial: matrix eigenvalue and subdivision algorithms, SIAM Rev. (2005), submitted for publication
10. Boyd J.P. Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves. Appl. Math. Comput. 174 2 (2006) 1642-1658
11. J.P. Boyd, D.H. Gally, Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials, J. Comput. Appl. Math. (2005), submitted for publication
12. D.M. Day, L. Romero, Roots of polynomials expressed in terms of orthogonal polynomials, SIAM J. Numer. Anal. (2005), submitted for publication
13. Goedecker S. Remarks on algorithms to find roots of polynomials. SIAM J. Sci. Comput. 15 (1994) 1059-1063
14. Lanczos C. Applied Analysis (1956), Prentice-Hall, Englewood Cliffs, NJ Reprinted by Dover, 1988
15. Pan V.Y. Solving a polynomial equation: Some history and recent progress. SIAM Rev. 39 (1997) 187-220
16. Smiley M.W., and Chun C. An algorithm for finding all solutions of a nonlinear system. J. Comput. Appl. Math. 137 (2001) 293-315
17. Stetter H.J. Numerical Polynomial Algebra (2004), SIAM, Philadelphia, PA
18. Trefethen L.N. Spectral Methods in Matlab (2000), SIAM, Philadelphia, PA
19. Weyl H. Randbermerkungen zu Hauptproblem der Mathematik, II. Fundamentalsatz der Algebra and Grundlagen der Mathematik. Math. Z. 20 (1924) 131-151