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.006MaRDI QIDQ2372929zbMATH OpenOpenAlexFDO

Authors 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

numerical examplesChebyshev polynomialsrootfindingKepler's equationChebyshev-Frobenius companion matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6824981
• 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
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding

Cites work

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

Cited in

(18)

• Computing the common zeros of two bivariate functions via Bézout resultants
• 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
• Finding the zeros of a univariate equation: Proxy rootfinders, Chebyshev interpolation, and the companion matrix
• Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind
• A new aspect of comrade matrices by reachability matrices
• New series for the cosine lemniscate function and the polynomialization of the lemniscate integral
• Convergence and error theorems for Hermite function pseudo-RBFs: interpolation on a finite interval by Gaussian-localized polynomials
• Distribution of eigenvalues for sub-skewtriagonal Hankel matrices
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
• Rootfinding through global Newton iteration and Chebyshev polynomials for the amplitude of an electronic oscillator
• A comparison of companion matrix methods to find roots of a trigonometric polynomial
• Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach
• A brief introduction to pseudo-spectral methods: application to diffusion problems
• 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
• Multiple root finder algorithm for Legendre and Chebyshev polynomials via Newton's method
• A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters

Describes a project that uses

Uses Software

• Chebfun

This page was built for publication: Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

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