zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
A nonlinear multigrid for imaging electrical conductivity and permittivity at low frequency. (English) Zbl 0981.65126
Summary: We propose a nonlinear multigrid approach for imaging the electrical conductivity and permittivity of a body Ω, given partial, usually noisy knowledge of the Neumann-to-Dirichlet map at the boundary. The algorithm is a nested iteration, where the image is constructed on a sequence of grids in Ω, starting from the coarsest grid and advancing towards the finest one. We show various numerical examples that demonstrate the effectiveness and robustness of the algorithm and prove local convergence.
65N21Inverse problems (BVP of PDE, numerical methods)
65N55Multigrid methods; domain decomposition (BVP of PDE)
35R30Inverse problems for PDE