2010
DOI: 10.1007/s10958-010-9921-1
|View full text |Cite
|
Sign up to set email alerts
|

Adaptivity with relaxation for ill-posed problems and global convergence for a coefficient inverse problem

Abstract: A new framework of the functional analysis is developed for the finite element adaptive method (adaptivity) for the Tikhonov regularization functional for some ill-posed problems. As a result, the relaxation property for adaptive mesh refinements is established. An application to a multidimensional coefficient inverse problem for a hyperbolic equation is discussed. This problem arises in the inverse scattering of acoustic and electromagnetic waves. First, a globally convergent numerical method provides a good … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

7
141
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 64 publications
(148 citation statements)
references
References 22 publications
7
141
0
Order By: Relevance
“…Indeed, it is well known that a good first approximation for the solution is the true key for any locally convergent numerical method, and the first stage provides that approximation. Furthermore, it follows from results of [4] that the resulting two-stage procedure converges globally. So, when working with the backscattering data, we use the gradient method on the second stage.…”
Section: Introductionmentioning
confidence: 89%
See 4 more Smart Citations
“…Indeed, it is well known that a good first approximation for the solution is the true key for any locally convergent numerical method, and the first stage provides that approximation. Furthermore, it follows from results of [4] that the resulting two-stage procedure converges globally. So, when working with the backscattering data, we use the gradient method on the second stage.…”
Section: Introductionmentioning
confidence: 89%
“…As to the choice of V 1,1 , it was taken as V 1,1 ≡ 0 in [1]. In later publications [2,3,4,5,11,16,17] the initial tail V 1,1 was taken as the one, which corresponds to the case c (x) ≡ 1, where c (x) := 1 is the value of the unknown coefficient outside of the domain of interest Ω, see (2.5). An observation was that while both these choices give the same result, the second choice leads to a faster convergence and both choices satisfy conditions of the global convergence theorem.…”
Section: The Iterative Process (In Brief )mentioning
confidence: 99%
See 3 more Smart Citations