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
시뮬레이션이 예측을 넘어서려면, 분자 속으로 들어가야 한다
0dev.to Machine Learning
I know a few things about software and how to build websites but my problem right now is how to manually write codes and I’m using a low end laptop Geobook120
0dev.to Beginners
Day 6: Adding test cases for current features
0dev.to Testing
NASA Just Made a Bunch of Moon Base Announcements: Here’s What They Are
0CNET News
Idempotent publishing jobs #3g6b7
0dev.to
Canada renews the Local Journalism Initiative and extends journalism tax credit
0Hacker News New