arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1503.03996math.NAcs.NA
收藏

收敛与最优性分析hp自适应有限元方法

Convergence and Optimality of hp-AFEM

Politecnico di Torino(都灵理工大学);University of Maryland(马里兰大学);University of Amsterdam(阿姆斯特丹大学);Politecnico di Milano(米兰理工大学)

Claudio Canuto, Ricardo H. Nochetto, Rob Stevenson, Marco Verani

AI总结:

本文设计并分析了适用于一维和二维的hp自适应有限元方法,通过hp-NEARBEST和REDUCE两个步骤实现解的收敛与最优性证明。

摘要:

我们设计并分析了适用于一维和二维的自适应hp有限元方法(hp-AFEM)。该算法由两个迭代过程组成:hp-NEARBEST用于寻找当前离散解和数据的近最佳hp逼近,而REDUCE则提高离散解的精度。前者基于Binev最近的自适应hp逼近算法,作为粗化步骤。我们证明了该方法的收敛性和实例最优性。

英文摘要:

We design and analyze an adaptive $hp$-finite element method (hp-AFEM) in dimensions $n=1,2$. The algorithm consists of iterating two routines: hp-NEARBEST finds a near-best $hp$-approximation of the current discrete solution and data to a desired accuracy, and REDUCE improves the discrete solution to a finer but comparable accuracy. The former hinges on a recent algorithm by Binev for adaptive $hp$-approximation, and acts as a coarsening step. We prove convergence and instance optimality.

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

↑