Skip to content

Successive Schur-Riesz Analysis for Approximation

Matthew Francis Dixon

math.NAarXiv:2608.10757

Abstract

Many approximation methods enlarge a trial space by adjoining function blocks generated by different operators. Exact redundancy and strong cross-level interaction can make coefficients nonunique and render pairwise or diagonal-dominance tests needlessly pessimistic. For \(Vm=Σ≤ mS(E)\) in a Hilbert space H, we quotient coefficients representing the same function and control successive orthogonal innovations to obtain Riesz bounds independent of \(m\). The setting includes factored operators \(S=T·s T1:E H\), with compatible intermediate spaces, but the theorem allows arbitrary bounded \(S\). The same constants control approximation, truncation, perturbation, and levelwise error. A block Schur complement identifies the intrinsic new dimension and gives the exact reduction in squared best-approximation error, leading to a constructive enrichment procedure. Nonstationary and lifted examples give positive intrinsic bounds where diagonal-dominance estimates are negative or labelled Gram matrices are singular; adaptive and recycled-subspace calculations illustrate the distinct roles of representation stability and application-specific utility.

Create a lesson