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

自适应有限元法关于总计算费用的速率最优性

Rate optimality of adaptive finite element methods with respect to the overall computational costs

Gregor Gantner, Alexander Haberl, Dirk Praetorius, Stefan Schimanko

摘要:

考虑二阶椭圆型偏微分方程的自适应有限元法,其中所产生的离散系统不能精确求解。对于压缩迭代求解器,我们制定了一个自适应算法,监测和指导自适应网格细化以及所产生的离散系统的不精确解。我们证明了所提出的策略会导致具有最佳代数率的线性收敛。与以往的作品,但是,我们专注于收敛速度的整体计算成本。在明确的条款,建议的自适应策略,从而保证准最佳的计算时间。特别是,我们的分析涵盖线性问题,其中的线性系解决了一个最佳的预处理CG方法,以及具有强单调非线性的线性问题,线性化的所谓Zarantonello迭代。

英文摘要:

We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the adaptive mesh-refinement as well as the inexact solution of the arising discrete systems. We prove that the proposed strategy leads to linear convergence with optimal algebraic rates. Unlike prior works, however, we focus on convergence rates with respect to the overall computational costs. In explicit terms, the proposed adaptive strategy thus guarantees quasi-optimal computational time. In particular, our analysis covers linear problems, where the linear systems are solved by an optimally preconditioned CG method as well as nonlinear problems with strongly monotone nonlinearity which are linearized by the so-called Zarantonello iteration.

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

↑