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
Virtualized Redox: from Virtio-FS to Cloud Hypervisor, and beyond
0Lobsters
If Snap’s Specs are still ridiculously expensive, they’re also a lot more comfortable than they used to be
0TechCrunch
Coordinated disturbances haunt grids worldwide. Here’s how researchers solved the mystery.
0TechCrunch
Nvidia Board of Directors Is Investigating Jensen Huang
0Hacker News
Fishermen find Royal Caribbean cruise ship employee in water 20 miles off coast
0Hacker News New
Quotes and Dashes for Typography Novices
0Hacker News New