Description
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 interpolation. In higher dimensional complex regions, optimal sampling points are not known explicitly.
Download count: 0
Details
Contributors
- Liu, Tony (Author)
- Platte, Rodrigo B (Thesis advisor)
- Renaut, Rosemary (Committee member)
- Kaspar, David (Committee member)
- Moustaoui, Mohamed (Committee member)
- Motsch, Sebastien (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2019
Subjects
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2019Note typethesis
- Includes bibliographical references (pages 86-89)Note typebibliography
- Field of study: Mathematics
Citation and reuse
Statement of Responsibility
by Tony Liu