Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
From MaRDI portal
Publication:4785834
DOI10.1137/S0036142901398325zbMath1034.65028MaRDI QIDQ4785834
Publication date: 5 January 2003
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Chebyshev seriesrootfindingtranscendental equationconvert-to-powersdegree-doublingzeros of nonpolynomial functions
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
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, Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials, Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method, 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, Barycentric-Remez algorithms for best polynomial approximation in the chebfun system, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, Variable-stepsize Chebyshev-type methods for the integration of second-order I.V.P.'s, Robust and Efficient Solution of the Drum Problem via Nyström Approximation of the Fredholm Determinant, Fast multipole methods for approximating a function from sampling values, From matrix polynomial to determinant of block Toeplitz-Hessenberg matrix, New approximations to the principal real-valued branch of the Lambert \(W\)-function, 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, Solving 1D conservation laws using Pontryagin's minimum principle, An integral equation-based numerical solver for Taylor states in toroidal geometries, Structure-Preserving Function Approximation via Convex Optimization, Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach, Implicit QR for rank-structured matrix pencils, Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries, Chebfun: A New Kind of Numerical Computing, Error Localization of Best $L_{1}$ Polynomial Approximants, 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, Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering, Numerical Instability of Resultant Methods for Multidimensional Rootfinding, Computing the common zeros of two bivariate functions via Bézout resultants, A polynomial interpolation process at quasi-Chebyshev nodes with the FFT, Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
