Abstract
We construct the polynomial p*m,n of degree m which interpolates a given real-valued function f ∈ℒ2 [a, b] at pre-assigned n distinct nodes and is the best approximant to f in the L2-sense over all polynomials of degree ≤ m with the same interpolatory character. It is shown that the L2-error ∥p*m,n - f ∥ → 0 as m → ∞ if f ∈ C[a, b].
| Original language | English |
|---|---|
| Pages (from-to) | 201-205 |
| Number of pages | 5 |
| Journal | Journal of Computational and Applied Mathematics |
| Volume | 70 |
| Issue number | 2 |
| DOIs | |
| State | Published - 28 Jun 1996 |
Keywords
- Interpolation
- Least squares approximation
- Orthonormal basis
- Uniformly dense
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'L2-approximation of real-valued functions with interpolatory constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver