zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Preconditioned all-at-once methods for large, sparse parameter estimation problems. (English) Zbl 0995.65110

The inverse problem about recovering a parameter function by measurements of solutions of the system partial differential equations is considered. A typical formulation of this inverse problem consists minimization of the sum of a data fitting error term and a regularization term, subject to the forward problem being satisfied. The problem is typically ill-posed without regularization and it is ill-conditioned with it, since the regularization term is aimed at removing noise without overshadowing the data.

Let the forward problem be a linear elliptic differential equation A(m)u=q where A refers a differential operator depending on a parameter vector function m, defined on an appropriate domain and equipped with suitable boundary conditions. The discrimination of this problem is studied and for regularization the Tikhonov method with introducing the Lagrangian approach is applied. Finally the problem is numerically solved by the Gauss-Newton method, and a preconditioned conjugate gradient algorithm is applied at each iteration for the resulting reduced Hessian system. Alternatively, a preconditioned Krylov method is applied to arising system.

The considered problem the arises in many applications. The results are illustrated by different computational examples.

MSC:
65N21Inverse problems (BVP of PDE, numerical methods)
35R30Inverse problems for PDE
65N06Finite difference methods (BVP of PDE)
65F10Iterative methods for linear systems
65F35Matrix norms, conditioning, scaling (numerical linear algebra)
Software:
KELLEY