On the conditioning of polynomial histopolation
Abstract
Histopolation is the approximation procedure that associates a degree d-1 polynomial pd-1 ∈ Pd-1 (I) with a locally integrable function f imposing that the integral (or, equivalently, the average) of p coincides with that of f on a collection of d distinct segments si. In this work we discuss unisolvence and conditioning of the associated matrices, in an asymptotic linear algebra perspective, i.e., when the matrix-size d tends to infinity. While the unisolvence is a rather sparse topic, the conditioning in the unisolvent setting has a uniform behavior: as for the case of standard Vandermonde matrix-sequences with real nodes, the conditioning is inherently exponential as a function of d when the monomial basis is chosen. In contrast, for an appropriate selection of supports, the Chebyshev polynomials of second kind exhibit a bounded conditioning. A linear behavior is also observed in the Frobenius norm.
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.