2001
DOI: 10.1016/s0377-0427(00)00557-4
|View full text |Cite
|
Sign up to set email alerts
|

Optimal systems of nodes for Lagrange interpolation on bounded intervals. A survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 108 publications
(44 citation statements)
references
References 28 publications
0
43
0
Order By: Relevance
“…We have the following result on the Lebesgue constant for the Lagrange interpolation polynomials associated with the zeros of the Jacobi polynomials; see, e.g., [18]. …”
Section: Then For the Jacobi Gauss And Jacobi Gauss-radau Integrationmentioning
confidence: 99%
“…We have the following result on the Lebesgue constant for the Lagrange interpolation polynomials associated with the zeros of the Jacobi polynomials; see, e.g., [18]. …”
Section: Then For the Jacobi Gauss And Jacobi Gauss-radau Integrationmentioning
confidence: 99%
“…Lemma 3.5 (see [9]). For every bounded function u, there exists a constant C, independent of u such that…”
Section: Some Useful Lemmasmentioning
confidence: 99%
“…Lemma 3.6 (see [9]). Assume that {F j (x)} N j=0 are the N -th degree Lagrange basis polynomials associated with the Gauss points of the Jacobi polynomials.…”
Section: Some Useful Lemmasmentioning
confidence: 99%
“…From [22], we have the following result on the Lebesgue constant for Lagrange interpolation based on the zeros of the Jacobi polynomials. …”
Section: Lemma 31 (Estimates For Interpolation Error) Assume That ∂ mentioning
confidence: 99%