Computation of Chebyshev polynomials for union of intervals

DOI10.1007/s40315-019-00285-wzbMath1436.30004arXiv1903.04335OpenAlexW2966938928MaRDI QIDQ2297698

Simon Foucart, Jean-Bernard 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

Chebyshev polynomials of the second kindmethod of momentsnon-negative polynomialsChebyshev polynomials of the first kind

Mathematics Subject Classification ID

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

Related Items (3)

Instances of Computational Optimal Recovery: Dealing with Observation Errors ⋮ Instances of computational optimal recovery: refined approximability models ⋮ Numerical analysis of fractional viscoelastic column based on shifted Chebyshev wavelet function

Uses Software

• CVX
• Chebfun
• firpm
• Basc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of Chebyshev polynomials. I: Subsets of \({\mathbb {R}}\)
• Asymptotics of Chebyshev polynomials. II: DCT subsets of \(\mathbb{R}\)
• Orthogonal and extremal polynomials on several intervals
• Determining projection constants of univariate polynomial spaces
• Computation of capacity
• Orthogonal Polynomials on Several Intervals Via a Polynomial Mapping
• Basc: constrained approximation by semidefinite programming
• A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters

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