Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
From MaRDI portal
Publication:2489393
DOI10.1016/j.amc.2005.07.009zbMath1090.65052OpenAlexW2091039488MaRDI QIDQ2489393
Publication date: 16 May 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.07.009
Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
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, 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, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, 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, Parallel computation of real solving bivariate polynomial systems by zero-matching method, 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, Computing the common zeros of two bivariate functions via Bézout resultants, The Computation of Multiple Roots of a Bernstein Basis Polynomial
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Remark on Algorithms to Find Roots of Polynomials
- Solving a Polynomial Equation: Some History and Recent Progress
- Spectral Methods in MATLAB
- An Extension of MATLAB to Continuous Functions and Operators
- Locating and Computing Arbitrarily Distributed Zeros
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Numerical Polynomial Algebra
- Locating and Computing All the Simple Roots and Extrema of a Function
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
- How to find all roots of complex polynomials by Newton's method.
- An algorithm for finding all solutions of a nonlinear system
