pith. sign in

arxiv: 1210.7294 · v1 · pith:D6QPM3CMnew · submitted 2012-10-27 · 🧮 math-ph · math.MP

The adaptivity refines approximate solutions of ill-posed problems due to the relaxation property

classification 🧮 math-ph math.MP
keywords adaptivitycoefficientnumericalproblemsdataelementill-posedprocedure
0
0 comments X
read the original abstract

Adaptive Finite Element Method (adaptivity) is known to be an effective numerical tool for some ill-posed problems. The key advantage of the adaptivity is the image improvement with local mesh refinements. A rigorous proof of this property is the central part of this paper. In terms of Coefficient Inverse Problems with single measurement data, the authors consider the adaptivity as the second stage of a two-stage numerical procedure. The first stage delivers a good approximation of the exact coefficient without an advanced knowledge of a small neighborhood of that coefficient. This is a necessary element for the adaptivity to start iterations from. Numerical results for the two-stage procedure are presented for both computationally simulated and experimental data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.