On the conditioning of histopolation
Ludovico Bruni Bruno, Stefano Serra-Capizzano
TL;DR
This work analyzes the conditioning of histopolation Vandermonde matrices as the number of segments $d$ grows. It shows that using the standard monomial basis yields exponential conditioning $\kappa_2(V_d)$ across unisolvent segment classes, while a carefully chosen Chebyshev-2 basis on particular segment families (notably class (C2)) yields well-conditioned systems with bounded $\kappa_2$ and linear $\kappa_F$. The authors derive a determinant formula for class (C3), establish unisolvence for the new class (C4), and provide an explicit inversion formula for Chebyshev-segment matrices, highlighting the structural benefits of Chebyshev bases. Extending to generic intervals and connecting to the Fekete problem, the paper delineates when ill-conditioning arises and when conditioning can be controlled, with implications for numerical histopolation and related approximation problems.
Abstract
Histopolation is the approximation procedure that associates a degree $ d-1 $ polynomial $ p_{d-1} \in \mathscr{P}_{d-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 $s_i$. 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 basis of second kind has a bounded conditioning. A linear behavior is also observed in the Frobenius norm.
