General
A polynomial dimension-dependence analysis of Bramble--Pasciak--Xu preconditioners
arXiv cs.NA0 views
arXiv:2512.06166v3 Announce Type: replace Abstract: We investigate the dimension dependence of Bramble--Pasciak--Xu~(BPX) preconditioners for simplicial $\mathbb{P}_1$ finite element discretizations of high-dimensional partial differential equations and establish that the condition numbers of BPX-preconditioned systems grow only polynomially with the spatial dimension. Our analysis requires a careful derivation of the dimension dependence of several fundamental tools in the theory of finite element methods, including elliptic regularity, the Bramble--Hilbert lemma, trace inequalities, and inverse inequalities. We further analyze an averaged Scott--Zhang-type quasi-interpolation operator, and show that its associated constants scale polynomially with the dimension. Building on these ingredients, we prove a multilevel norm equivalence theorem and derive a BPX preconditioner with explicit polynomial bounds on its dimensional dependence. The analysis is motivated in part by recent tensor and quantum finite element methods, where dimension-explicit conditioning estimates for BPX preconditioners play an important role.
Source:https://arxiv.org/abs/2512.06166PreviousInterpretation of a Discrete de Rham method as a Finite Element SystemNextPersonalised 3D Mnemonics for Vocabulary Learning in Context
Related posts

118 Blog Posts To Learn About Self Help
0HackerNoon

Agent Hub Makes Agents Easy to Build. Production Needs a Release Contract.
0HackerNoon
Audioengine Color of the Year Kit Review: Bright Look, Good Sound
0Wired
Torrent underground
0The Verge
These Robotic Arms Are Powered by Algae. Watch How They Move
0Wired
PixelOS
0Hacker News