2019
DOI: 10.1007/s40315-019-00285-w
|View full text |Cite
|
Sign up to set email alerts
|

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 Ch… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…Its advantages are high‐accuracy, fewer iterations, and less computation time 17 . Legendre, 18 Bernstein, 19,20 and Chebyshev polynomials 21‐23 are often employed to construct wavel et algorithms. Chen et al 24 employed wavelet method for solving the nonlinear fractional differential equations.…”
Section: Introductionmentioning
confidence: 99%
“…Its advantages are high‐accuracy, fewer iterations, and less computation time 17 . Legendre, 18 Bernstein, 19,20 and Chebyshev polynomials 21‐23 are often employed to construct wavel et algorithms. Chen et al 24 employed wavelet method for solving the nonlinear fractional differential equations.…”
Section: Introductionmentioning
confidence: 99%
“…In this section, we uncover situations where, using techniques from Robust Optimization [2], it is possible to exactly compute the Chebyshev center of the set Q(K E (y)) defined by the observational data y ∈ R m . It is assumed here that the quantity of interest Q takes values in Z = ℓ K ∞ and we write (8) Q…”
Section: Computation Of Chebyshev Centersmentioning
confidence: 99%
“…Chen et al (2015) applied the wavelet method to solve nonlinear fractional differential equations, offering a different perspective on solving complex problems. Legendre (Boonrod and Mohsen, 2019), Bernstein (Bourne et al, 2017; Wang et al, 2018), and Chebyshev polynomials (Foucart and Lasserre, 2019; Sakran, 2019; Sweilam et al, 2015) are commonly used to construct wavelet algorithms.…”
Section: Introductionmentioning
confidence: 99%