Optimal Sampling for Linear Function Approximation and High-Order Finite Difference Methods over Complex Regions
abstract: I focus on algorithms that generate good sampling points for function approximation. In 1D, it is well known that polynomial interpolation using equispaced points is unstable. On the other hand, using Chebyshev nodes provides both stable and highly accurate points for polynomial interpolat...
| Other Authors: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2286/R.I.54897 |