A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem

DOI10.1006/JCPH.1995.1075MaRDI QIDQ1891069zbMATH OpenOpenAlexFDO

Authors John P. Boyd

Publication date 24 October 1995

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.1995.1075

zbMATH Keywords

eigenvaluesNewton's methodpolynomial approximationnonlinear eigenvalue problemapproximation of zerosChebyshev polynomial interval-searching methodLanczos economizationzeros of determinants

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Recommendations

• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• A Survey of Open Cavity Scattering Problems
• Chebyshev interpolation for nonlinear eigenvalue problems
• New algorithms for solving nonlinear eigenvalue problems
• scientific article; zbMATH DE number 3988630

Cited in

(10)

• Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
• 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 with linear testing and cubic solves
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• New series for the cosine lemniscate function and the polynomialization of the lemniscate integral
• Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
• A comparison of companion matrix methods to find roots of a trigonometric polynomial
• Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• 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

This page was built for publication: A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem

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