Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: Solving transcendental equations by spectral interpolation and polynomial rootfinding

Journal of Engineering Mathematics

Volumn 56, Issue 3, 2006, Pages 203-219

  Boyd, John P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Companion matrix methods; Gegenbauer; Spectral series; Spherical harmonics; Trigonometric polynomial

Indexed keywords

ALGORITHMS; INTERPOLATION; POLYNOMIALS;

COMPANION-MATRIX METHODS; SPECTRAL SERIES; SPHERICAL HARMONICS; TRIGONOMETRIC POLYNOMIAL;

MATRIX ALGEBRA;

ALGORITHMS; INTERPOLATION; MATRIX ALGEBRA; POLYNOMIALS;

EID: 33846670221     PISSN: 00220833     EISSN: 15732703     Source Type: Journal    
DOI: 10.1007/s10665-006-9087-5     Document Type: Review

References (37)

1. Boyd JP (2004) A review of high-order methods for incompressible fluid flow by M. O. Deville, P. F. Fischer and E. H. Mund. SIAM Rev 46:151-157
2. Boyd JP (1995) A Chebyshev polynomial interval-searching method ("Lanczos economization") for solving a nonlinear equation with application to the nonlinear eigenvalue problem. J Comput Phys 118:1-8
3. Boyd JP (2002) Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM J Num Anal 40:1666-1682
4. Boyd JP (2006) Finding the roots of a transcendental equation: How Chebyshev polynomials, algebraic geometry and matrix theory have solved a quest begun in Babylon. Math Intell submitted
5. Weidner P (1988) The Durand-Kerner method for trigonometric and exponential polynomials. Computing 40:175-179
6. Battles Z, Trefethen LN (2004) An extension of Matlab to continuous functions and operators. SIAM J Sci Comp 25:1743-1770
7. Toh K, Trefethen LN (1994) Pseudozeros of polynomials and pseudospectra of companion matrices. Num Math 68:403-425
8. Parlett BN, Reinsch C (1969) Balancing a matrix for calculation of eigenvalues and eigenvectors. Num Math 13:293-304
9. Boyd JP, Gally DH (2005) Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials. J Comp Appl Math (in proof)
10. Boyd JP (2001) Chebyshev and Fourier spectral methods 2nd edn. Dover, Mineola, New York
11. Jónsson GF, Vavasis S (2004) Solving polynomials with small leading coefficients. SIAM J Matrix Anal Appl 26:400-414
12. Boyd JP (2006) Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries. Comput Math Appl submitted
13. Day D, Romero L (2005) Roots of polynomials expressed in terms of orthogonal polynomials. SIAM J Num Anal 43:1969-1987
14. Boyd JP (2006) Computing real roots of a polynomial in Chebyshev series form through subdivision. Appl Num Math in proof
15. Boyd JP (2006) Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves. Appl Math Comp 174:1642-1648
16. Boyd JP (2006) A test for an interval to be free of zeros for polynomials in Chebyshev form through conversion to the Bernstein polynomial basis. Appl Math Comp submitted
17. Boyd JP (2006) Rootfinding for a transcendental equation without a first guess: Polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine. Appl Num Math 52:12-18
18. Fraser W, Wilson MW (1966) Remarks on the Clenshaw-Curtis quadrature scheme. SIAM Rev 8:322-327
19. Sloan IH, Smith WE (1980) Product integration with the Clenshaw-Curtis quadrature scheme. SIAM Rev 8:322-327
20. Trefethen LN, Schreiber RS (1990) Average-case stablity of Gaussian elimination. SIAM J Matrix Anal Appl 11:335-360
21. Clenshaw CW, Curtis AR (1960) A method for numerical integration on an automatic computer. Num Math 2:197-205
22. Jacobs SJ (1990) A variable order pseudospectral method for two-point boundary value problems. J Comp Phys 88:169-182
23. Mason JC, Handscomb DC (2003) Chebyshev polynomials. Chapman and Hall/ CRC press, Boca Raton, Florida
24. Specht W (1957) Die Lage der Nullstellen eines Polynom III. Math Nach 16:369-389
25. Specht W (1960) Die Lage der Nullstellen eines Polynom IV. Math Nach 21:201-222
26. Barnett S (1975) Companion matrix analog for orthogonal polynomials. Linear Algebra Appl 12:197-208
27. Stetter HJ (2004) Numerical polynomial algebra, Society for Industrial and Applied Mathematics. Philadelphia, Pennsylvania
28. Gol'berg EM, Malozemov VN (1979) Estimates for the zeros of certain polynomials. Vestmol Leningrad Univ Math 6:127-135. Translated from Vestnik Leningrad Univ Mat Mekh Astr 7(1973), 18-24
29. Angelova ED, Semerdzhiev KI (1982) Methods for the simulataneous approximate derivation of the roots of algebraic, trigonometric and exponential equations. USSR Comp Maths Math Phys 22:226-232
30. Makrelov IV, Semerdzhiev HI (1985) Methods for the simultaneous determination of all zeros algebraic, trigonometric and exponential equations. USSR Comp Maths Math Phys 24:1443-1453
31. Makrelov IV Semerdzhiev HI (1985) On the convergence of two methods for the simultaneous find of all roots of exponential equations. IMA J Num Anal 5:191-200
32. Frommer A (1988) A unified approach to methods for the simulataneous computation of all zeros of generalized polynomials. Num Math 54:105-116
33. Schweikard A (1991) Trigonmetric polynomials with simple roots. Inform Process Lett 39:231-236
34. Schweikard A (1992) Real zero isolation for trigonmetric polynomials. ACM Trans Math Software 18:350-359
35. Carstensen C, Petkovi'c MS (1993) On some interval methods for algebraic, exponential and trigonomertric polynomials. Computing 51:313-326
36. Carstensen C, Reinders M (1993) On a class of higer order methods for simultaneous rootfinding of generalized polynomials. Num Math 64:69-84
37. Carstensen C (1994) A note on simulataneous rootfinding for algebraic, exponential, and trigonomertric polynomials. Comp Math Appl 27:7-14