Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
From MaRDI portal
rootfindingChebyshev seriestranscendental equationconvert-to-powersdegree-doublingzeros of nonpolynomial functions
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Recommendations
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- 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
- 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
Cited in
(35)- From matrix polynomial to determinant of block Toeplitz-Hessenberg matrix
- A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
- \texttt{Chebfun}: A new kind of numerical computing
- 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 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
- Fast multipole methods for approximating a function from sampling values
- 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
- Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
- Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- 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
- Structure-preserving function approximation via convex optimization
- Robust and efficient solution of the drum problem via Nyström approximation of the Fredholm determinant
- 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
- Numerical instability of resultant methods for multidimensional rootfinding
- Variable-stepsize Chebyshev-type methods for the integration of second-order I.V.P.'s
- Implicit QR for rank-structured matrix pencils
- 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
- Quasi-analytical root-finding for non-polynomial functions
- Enclosing Chebyshev expansions in linear time
- Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach
- 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
- New approximations to the principal real-valued branch of the Lambert W-function
- An integral equation-based numerical solver for Taylor states in toroidal geometries
- Solving 1D conservation laws using Pontryagin's minimum principle
- 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
- Error localization of best \(L_1\) polynomial approximants
- scientific article; zbMATH DE number 6824981 (Why is no real title available?)
This page was built for publication: Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785834)
