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.049zbMATH Open1121.65049OpenAlexW2042567159MaRDI QIDQ2372059FDOQ2372059

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

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

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)

Cites Work

• Title not available (Why is that?)
• An Extension of MATLAB to Continuous Functions and Operators
• Spectral Methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the numerical condition of polynomials in Bernstein form
• Legendre-Bernstein basis transformations
• Jacobi-Bernstein Basis Transformation
• Transformation of Chebyshev–Bernstein Polynomial Basis
• Degree reduction of Bézier curves
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
• 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 with linear testing and cubic solves
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• Basis conversion among Bézier, Tchebyshev and Legendre
• Computation of the solutions of nonlinear polynomial systems
• Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials
• Bernstein form of a polynomial
• Basis conversions among univariate polynomial representations

Cited In (11)

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

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)