Thin obstacle problem: Estimates of the distance to the exact solution

Apushkinskaya, D. E.; Repin, Sergey

doi:10.4171/ifb/410

Cited by 5 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this purpose we combine the methods earlier developed for stationary problems with obstacles (see [Rep00], [Rep07], [Rep08], [AR18], [AR20]) and for parabolic equations (see [Rep02], [MR16], [LMR19]).…”

Section: Estimates Of the Distance To The Exact Solutionmentioning

confidence: 99%

Functional a posteriori error estimates for parabolic obstacle problems

Apushkinskaya,

Repin

2021

Preprint

View full text Add to dashboard Cite

The paper is concerned with functional type a posteriori estimates for the initial boundary value problem for a parabolic partial differential equation with an obstacle. We deduce a guaranteed and computable bound of the distance between the exact minimizer and any function from the admissible (energy) class of functions. Applications to the analysis of modeling errors caused by data implification are discussed. An important case of time incremental approximations is specially studied. Numerical examples presented in the last section show how the estimates work in practice.

show abstract

Section: Estimates Of the Distance To The Exact Solutionmentioning

confidence: 99%

Functional a posteriori error estimates for parabolic obstacle problems

Apushkinskaya,

Repin

2021

Preprint

View full text Add to dashboard Cite

show abstract

Biharmonic Obstacle Problem: Guaranteed and Computable Error Bounds for Approximate Solutions

Apushkinskaya

Repin

2020

Comput. Math. and Math. Phys.

View full text Add to dashboard Cite

The paper is concerned with a free boundary variational 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 1 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.

show abstract