Local convergence of the Lavrentiev method for the Cauchy problem via a Carleman inequality (Q357814)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6198192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local convergence of the Lavrentiev method for the Cauchy problem via a Carleman inequality |
scientific article; zbMATH DE number 6198192 |
Statements
Local convergence of the Lavrentiev method for the Cauchy problem via a Carleman inequality (English)
0 references
13 August 2013
0 references
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.
0 references
Cauchy problem
0 references
Lavrentiev regularization
0 references
Carleman estimate
0 references
illposedness
0 references
bias and variance bounds
0 references
data completion problem
0 references
superconvergence
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0.8142223954200745
0 references
0.7970638871192932
0 references
0.789910614490509
0 references
0.7801482081413269
0 references
