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

针对障碍问题的伽辽金最小二乘有限元方法

Galerkin least squares finite element method for the obstacle problem

University College London(伦敦大学学院);Jönköping University(延雪平大学);Umeå University(于默奥大学);Helsinki University of Technology(赫尔辛基理工大学)

Erik Burman, Peter Hansbo, Mats G. Larson, Rolf Stenberg

AI总结:

本文提出一种无乘子的有限元求解障碍问题方法,通过增广拉格朗日公式消除乘子,证明了解的唯一性和最优前验误差估计,并通过数值实验验证了方法的有效性。

摘要:

我们为有限元求解障碍问题构造了一种一致的无乘子方法。该方法基于增广拉格朗日公式,在离散设置中利用乘子的定义来消除乘子。我们证明了离散解的存在性和唯一性,以及对于光滑精确解的最优阶前验误差估计。利用饱和假设,我们还证明了后验误差估计。数值实验展示了该方法及自适应算法对离散误差控制的性能。

英文摘要:

We construct a consistent multiplier free method for the finite element solution of the obstacle problem. The method is based on an augmented Lagrangian formulation in which we eliminate the multiplier by use of its definition in a discrete setting. We prove existence and uniqueness of discrete solutions and optimal order a priori error estimates for smooth exact solutions. Using a saturation assumption we also prove an a posteriori error estimate. Numerical examples show the performance of the method and of an adaptive algorithm for the control of the discretization error.

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

↑