On node distributions for interpolation and spectral methods
Abstract
A scaled Chebyshev node distribution is studied in this paper. It is proved that the node distribution is optimal for interpolation in CMs+1[-1,1], the set of (s+1)-time differentiable functions whose (s+1)-th derivatives are bounded by a constant M>0. Node distributions for computing spectral differentiation matrices are proposed and studied. Numerical experiments show that the proposed node distributions yield results with higher accuracy than the most commonly used Chebyshev-Gauss-Lobatto node distribution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.