On the approximation properties of fast Leja points
Abstract
Fast Leja points on an interval are points constructed using a discrete modification of the algorithm for constructing Leja points. Not much about fast Leja points has been proven theoretically. We present an asymptotic property of a triangular interpolation array, and under the assumption that fast Leja points satisfy this property, we prove that they are good for Lagrange interpolation.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.