Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

DOI10.1016/j.cam.2006.05.006zbMath1118.65032OpenAlexW2121050416MaRDI QIDQ2372929

Daniel H. Gally, John P. Boyd

Publication date: 17 July 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2006.05.006

zbMATH Keywords

Chebyshev polynomialsnumerical examplesKepler's equationrootfindingChebyshev-Frobenius companion matrix

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series, Unnamed Item, A comparison of companion matrix methods to find roots of a trigonometric polynomial, Distribution of eigenvalues for sub-skewtriagonal Hankel matrices, New series for the cosine lemniscate function and the polynomialization of the lemniscate integral, Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind, A brief introduction to pseudo-spectral methods: application to diffusion problems, Convergence and error theorems for Hermite function pseudo-RBFs: interpolation on a finite interval by Gaussian-localized polynomials, Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach, Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries, Computing real roots of a polynomial in Chebyshev series form through subdivision, Computing the common zeros of two bivariate functions via Bézout resultants, A polynomial interpolation process at quasi-Chebyshev nodes with the FFT, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters

Uses Software

• Chebfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for numerical integration on an automatic computer
• A companion matrix analogue for orthogonal polynomials
• A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• Die Lage der Nullstellen eines Polynoms
• Die Lage der Nullstellen eines Polynoms. IV
• An Extension of MATLAB to Continuous Functions and Operators
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Numerical Polynomial Algebra
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions