arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.01028math.NAcs.NA
收藏

具有最优收敛速度的自适应保证下eigenvalue界

Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates

Carsten Carstensen, Sophie Puttkammer

摘要:

利用最近引入的额外稳定的Crouzeix-Raviart($m=1$)或Morley($m=2$)有限元特征值求解器,可以计算$m$ -th Laplace算子的保证Dirichlet特征值下界(GLB).一个新的自适应特征值求解器的优越性,激发了惊人的数值证据的收敛性分析,在本文中的最佳收敛速度的GLB对一个简单的特征值的证明。证明是基于(一个推广)已知的抽象参数称为公理的适应性。在已知的先验收敛速度之外,本文还对最佳逼近结果进行了中值分析。这和从属$L^2$误差估计局部细化三角出现独立的利益。自适应网格细化算法的最佳收敛速度的分析在$3$ D中进行,并突出了一个新版本的离散可靠性。

英文摘要:

Guaranteed lower Dirichlet eigenvalue bounds (GLB) can be computed for the $m$-th Laplace operator with a recently introduced extra-stabilized nonconforming Crouzeix-Raviart ($m=1$) or Morley ($m=2$) finite element eigensolver. Striking numerical evidence for the superiority of a new adaptive eigensolver motivates the convergence analysis in this paper with a proof of optimal convergence rates of the GLB towards a simple eigenvalue. The proof is based on (a generalization of) known abstract arguments entitled as the axioms of adaptivity. Beyond the known a priori convergence rates, a medius analysis is enfolded in this paper for the proof of best-approximation results. This and subordinated $L^2$ error estimates for locally refined triangulations appear of independent interest. The analysis of optimal convergence rates of an adaptive mesh-refining algorithm is performed in $3$D and highlights a new version of discrete reliability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑