Bramble-Pasciak-Xu预处理器的多项式维度依赖性分析
A polynomial dimension-dependence analysis of Bramble--Pasciak--Xu preconditioners
AI总结:
研究BPX预处理器在高维偏微分方程中的维度依赖性,证明条件数仅随维度多项式增长,通过推导有限元工具和平均Scott-Zhang拟插值算子的维度依赖性,建立多水平范数等价定理,给出显式多项式界。
摘要:
我们研究了Bramble-Pasciak-Xu (BPX)预处理器在高维偏微分方程中的维度依赖性,并证明BPX预处理系统的条件数仅随空间维度多项式增长。我们的分析需要仔细推导有限元方法理论中几个基本工具的维度依赖性,包括椭圆正则性、Bramble-Hilbert引理、迹不等式和逆不等式。我们进一步分析了一个平均Scott-Zhang型拟插值算子,并证明其相关常数随维度多项式增长。基于这些要素,我们证明了一个多水平范数等价定理,并推导出一个BPX预处理器,其维度依赖性具有显式的多项式界。该分析部分受到近期张量和量子有限元方法的启发,其中BPX预处理器的维度显式条件估计起着重要作用。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。