Skip to Main content Skip to Navigation
Journal articles

Computation of Chebyshev Polynomials for Union of Intervals

Abstract : Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L ∞-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.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.laas.fr/hal-02062836
Contributor : Jean Bernard Lasserre <>
Submitted on : Sunday, March 10, 2019 - 4:08:34 AM
Last modification on : Thursday, June 10, 2021 - 3:07:09 AM
Long-term archiving on: : Tuesday, June 11, 2019 - 2:19:59 PM

Files

ChebPolyFGS_v5.pdf
Files produced by the author(s)

Identifiers

Citation

Simon Foucart, Jean-Bernard Lasserre. Computation of Chebyshev Polynomials for Union of Intervals. Computational Methods and Function Theory, Springer, 2019, ⟨10.1007/s40315-019-00285-w⟩. ⟨hal-02062836⟩

Share

Metrics

Record views

113

Files downloads

229