Schur-Riesz Variational Enrichment: A Generalized Refinement Framework for Finite Elements

Abstract

Width theory identifies economical spaces for compact PDE solution families, but does not provide a stable adaptive selection rule. We introduce Schur-Riesz refinement, which compares ordinary h/p refinement with operator-informed functions on a common variational scale. Projection removes content already represented by the incumbent, Riesz bounds test coefficient stability, and exact Schur gain ranks the surviving directions. New non-regression, bulk-contraction, and mixed near-oracle results provide finite-run error, dimension, and work certificates for coercive Galerkin and noncoercive minimum-residual formulations. We applied Schur-Riesz refinement across coercive and noncoercive PDEs. At matched dimension, automatic modes reduce held-out error by $50.2\%$ for 2D heterogeneous Helmholtz and $30.9\%$ for 2D Darcy. At matched Darcy error, the selected space uses $38.2\%$ fewer coordinates, reducing deployment memory by $38.9\%$ and online time by $30.1\%$. The additional offline construction is reusable and can be amortized across multiple right-hand sides for a fixed operator. On locked 3D heterogeneous Helmholtz tests, the method reduces mean error by $25.1$-$47.3\%$ against matched spectral-polynomial spaces and meets target errors with 24-96 coordinates, versus 1,331-6,859 for native MFEM hp-refinement. In an adaptive audit, 48 coordinates attain mean error $.1092$, compared with $.0967$ using 878 polynomial coordinates, while making online solves $6.8\times$ faster. Thus, the experiments demonstrate that Schur-Riesz refinement can construct smaller stable spaces with lower deployment memory and repeated-solve cost, while preserving a certified incumbent when richer functions do not help.