2012
DOI: 10.1016/j.mcm.2011.11.023
|View full text |Cite
|
Sign up to set email alerts
|

The third and fourth kinds of Chebyshev polynomials and best uniform approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…Further, as for Chebyshev polynomials of all four kinds and Legendre, Laguerre, Fibonacci, and Lucas polynomials, certain sums of finite products of such polynomials are also expressed in terms of all four kinds of Chebyshev polynomials in [5,6,17,18]. Finally, the reader may want to look at [19][20][21] for some applications of Chebyshev polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…Further, as for Chebyshev polynomials of all four kinds and Legendre, Laguerre, Fibonacci, and Lucas polynomials, certain sums of finite products of such polynomials are also expressed in terms of all four kinds of Chebyshev polynomials in [5,6,17,18]. Finally, the reader may want to look at [19][20][21] for some applications of Chebyshev polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…Worthy of note is the fact that many authors have also given numerous and analytical methods for solving Integrodifferential equations. Some examples include; Eslahchi et al (2012) combined the Adomian's decompositions technique with a Wavelet-Galerking approach to solving Integrodifferential Equations. To establish an approximate solution of higher-order linear Fredholm Integrodifferential equations, a realistic matrix technique can be used (Kurt & Sezer, 2008) which possess a constant coefficient beneath the initial boundary condition in phrases of Taylor polynomials, numerical solution of mixed linear Integrodifferential difference equations is considered using the Chebyshev collocation method.…”
Section: Introductionmentioning
confidence: 99%
“…To keep the merits of low-order polynomials while overcome their weakness for building surrogate models, the high-order polynomials [23] can be applied to establish surrogate models, such as, the Bernstain polynomials [24,25], Chebyshev polynomials [26,27] and Gegenbauer functions [28].…”
Section: Introductionmentioning
confidence: 99%