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.006zbMATH Open1118.65032OpenAlexW2121050416MaRDI QIDQ2372929FDOQ2372929
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
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
numerical examplesChebyshev polynomialsrootfindingKepler's equationChebyshev-Frobenius companion matrix
Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cites Work
- An Extension of MATLAB to Continuous Functions and Operators
- A method for numerical integration on an automatic computer
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Polynomial Algebra
- Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
- 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
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Title not available (Why is that?)
- Die Lage der Nullstellen eines Polynoms
- Die Lage der Nullstellen eines Polynoms. IV
- Title not available (Why is that?)
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
- A new aspect of comrade matrices by reachability matrices
- Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind
- 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
- A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters
- Multiple root finder algorithm for Legendre and Chebyshev polynomials via Newton's method
Uses Software
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)
