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

DOI10.1016/J.AMC.2006.11.049MaRDI QIDQ2372059zbMATH OpenOpenAlexFDO

Authors John P. Boyd

Publication date 10 July 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.11.049

zbMATH Keywords

Bernstein polynomialsChebyshev polynomialscondition numbersrootfindingChebyshev seriessubdivision methodsChebyshev intervalprune-and-branch

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Numerical computation of solutions to single equations (65H05)

Recommendations

• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• On a modification of Chebyshev's method
• 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
• Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

Cites work

• scientific article; zbMATH DE number 3179593 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1103275 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• scientific article; zbMATH DE number 3080734 (Why is no real title available?)
• A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
• An Extension of MATLAB to Continuous Functions and Operators
• Basis conversion among Bézier, Tchebyshev and Legendre
• Basis conversions among univariate polynomial representations
• Bernstein form of a polynomial
• Computation of the solutions of nonlinear polynomial systems
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• Degree reduction of Bézier curves
• Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Jacobi-Bernstein Basis Transformation
• Legendre-Bernstein basis transformations
• Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
• On the numerical condition of polynomials in Bernstein form
• Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• Spectral Methods
• Transformation of Chebyshev–Bernstein Polynomial Basis

Cited in

(11)

• Convergence and error theorems for Hermite function pseudo-RBFs: interpolation on a finite interval by Gaussian-localized polynomials
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials
• Six strategies for defeating the Runge phenomenon in Gaussian radial basis functions on a finite interval
• Gauss-Lobatto to Bernstein polynomials transformation
• New series for the cosine lemniscate function and the polynomialization of the lemniscate integral
• scientific article; zbMATH DE number 4064370 (Why is no real title available?)
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• Sensitivity of RBF interpolation on an otherwise uniform grid with a point omitted or slightly shifted
• Enclosing Chebyshev expansions in linear time
• Solutions of 2nd-order linear differential equations subject to Dirichlet boundary conditions in a Bernstein polynomial basis

Describes a project that uses

Uses Software

• Chebfun

This page was built for publication: 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

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