Description
This thesis project focuses on algorithms that generate good sampling points for function approximation. In one dimension, polynomial interpolation using equispaced points is unstable, with high Oscillations near the endpoints of the interpolated interval. On the other hand, Chebyshev nodes provide both stable and highly accurate points for polynomial interpolation.
Copyright Statement
Download count: 0
Details
Contributors
- Guo, Maosheng (Author)
- Platte, Rodrigo (Thesis director)
- Welfert, Bruno (Committee member)
- School of Mathematical and Statistical Sciences (Contributor, Contributor)
- Department of Physics (Contributor)
- Barrett, The Honors College (Contributor)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2021-05
Resource Type
Collections this item is in