论文标题

Biharmonic障碍问题:可确保和可计算的错误界限用于近似解决方案

Biharmonic obstacle problem: guaranteed and computable error bounds for approximate solutions

论文作者

Apushkinskaya, Darya E., Repin, Sergey I.

论文摘要

该论文关注的是Biharmonic操作员和障碍物产生的自由边界问题。主要目标是从相应的能量类别中推断出确切的最小化u与任何功能(近似)之间差异的完全保证的上限(由$ h^2 $组成,满足规定的边界条件和障碍规定的限制)。为此,我们使用二元方法的变异和一般类型误差身份的二重性方法,该方法先前用于一类凸变性问题。通过这种方法,我们定义了一个组合的原始 - 偶数误差量度。它包含不同性质的四个术语。其中两个是确切解(直接和双重变异问题)与相应近似值之间差异的规范。另外两个是非线性度量,与巧合集的近似有关(如果通过近似解决方案与精确的溶液相吻合的巧合集消失了)。该度量满足误差身份,右侧仅取决于近似解决方案,因此是完全可计算的。因此,身份提供了对原始误差的直接估计。但是,它包含对双重近似形式的一定限制。在本文的第二部分中,我们提供了一种跳过限制的方法。结果,无论其构造方法如何,我们都会获得完全保证和直接可计算的错误专业。在具有不同近似解决方案的一系列测试中验证了估计值。其中一些非常接近确切的解决方案,而另一些则相当粗糙,并且具有与确切的巧合不同。结果表明,在所有情况下,估计值都是稳健且有效的。

The paper is concerned with a free boundary problem generated by the biharmonic operator and an obstacle. The main goal is to deduce a fully guaranteed upper bound of the difference between the exact minimizer u and any function (approximation) from the corresponding energy class (which consists of the functions in $H^2$ satisfying the prescribed boundary conditions and the restrictions stipulated by the obstacle). For this purpose we use the duality method of the calculus of variations and general type error identities earlier derived for a wide class of convex variational problems. By this method, we define a combined primal--dual measure of error. It contains four terms of different nature. Two of them are the norms of the difference between the exact solutions (of the direct and dual variational problems) and corresponding approximations. Two others are nonlinear measures, related to approximation of the coincidence set (they vanish if the coincidence set defined by means of the approximate solution coincides with the exact one). The measure satisfies the error identity, which right hand side depends on approximate solutions only and, therefore, is fully computable. Thus, the identity provides direct estimation of the primal--dual errors. However, it contains a certain restriction on the form of the dual approximation. In the second part of the paper, we present a way to skip the restriction. As a result, we obtain a fully guaranteed and directly computable error majorant valid for a wide class of approximations regardless of the method used for their construction. The estimates are verified in a series of tests with different approximate solutions. Some of them are quite close to the exact solution and others are rather coarse and have coincidence sets that differ much from the exact one. The results show that the estimates are robust and effective in all the cases.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源