Computation of Chebyshev polynomials for union of intervals

DOI10.1007/S40315-019-00285-WMaRDI QIDQ2297698zbMATH OpenOpenAlexFDO

Authors Simon Foucart, Jean B. Lasserre

Publication date 20 February 2020

Published in Computational Methods and Function Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.04335

zbMATH Keywords

method of momentsnon-negative polynomialsChebyshev polynomials of the first kindChebyshev polynomials of the second kind

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) Approximation in the complex plane (30E10)

Abstract: Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these polynomials in case K is a finite union of compact intervals. For Chebyshev polynomials of the first kind, the procedure makes use of a characterization of polynomial nonnegativity. It can incorporate additional constraints, e.g. that all the roots of the polynomial lie in K. For Chebyshev polynomials of the second kind, the procedure exploits the method of moments. Key words and phrases: Chebyshev polynomials of the first kind, Chebyshev polynomials of the second kind, nonnegative polynomials, method of moments, semidefinite programming.

Recommendations

• Description of extremal polynomials on several intervals and their computation. I
• Chebyshev polynomials for disjoint compact sets
• Effective computation of Chebyshev polynomials for several intervals
• scientific article; zbMATH DE number 3996319
• The Chebyshev Polynomials of a Matrix

Cites work

• scientific article; zbMATH DE number 477682 (Why is no real title available?)
• scientific article; zbMATH DE number 739279 (Why is no real title available?)
• scientific article; zbMATH DE number 1077997 (Why is no real title available?)
• A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters
• Asymptotics of Chebyshev polynomials. I: Subsets of \({\mathbb {R}}\)
• Asymptotics of Chebyshev polynomials. II: DCT subsets of \(\mathbb{R}\)
• Basc: constrained approximation by semidefinite programming
• Computation of capacity
• Determining projection constants of univariate polynomial spaces
• Orthogonal Polynomials on Several Intervals Via a Polynomial Mapping
• Orthogonal and extremal polynomials on several intervals

Cited in

(6)

• Instances of computational optimal recovery: dealing with observation errors
• Computations with half-range Chebyshev polynomials
• Instances of computational optimal recovery: refined approximability models
• Numerical analysis of fractional viscoelastic column based on shifted Chebyshev wavelet function
• Optimization-aided construction of multivariate Chebyshev polynomials
• Computing the values of \(L\)-functions, and the Chebyshev polynomials

Describes a project that uses

Uses Software

• Basc
• firpm
• Chebfun
• CVX

This page was built for publication: Computation of Chebyshev polynomials for union of intervals

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