Local convergence of the Lavrentiev method for the Cauchy problem via a Carleman inequality (Q357814): Difference between revisions

The data completion problem consists of recovering data on an inaccessible part of the boundary from abundant measurements on an accessible part of the boundary. This is known as Cauchy's problem and the over-specified boundary conditions are called Cauchy data. The main feature of this problem is the ill-posedness, and some regularization strategy is necessary for numerical computations. The authors perform an analysis of the Lavrentiev method and determine that a sort of ``super-convergence'' is rather inherent to the nature of the Cauchy problem, and that any reasonable regularization procedure would enjoy the same locally super-convergent behavior. Some analytic and numerical examples are provided.