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)
Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems. (English) Zbl 1204.65140
The authors propose a substructuring preconditioner for solving three-dimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by J. H. Bramble, J. E. Pasciak and A. H. Schatz [Math. Comput. 53, No. 187, 1–24 (1989; Zbl 0668.65082)], but with much simpler coarse solvers. It is shown that the preconditioned conjugate gradient method with such substructuring preconditioner has a nearly optimal convergence rate, although the condition numbers of the preconditioned systems are not quasi-optimal yet.
MSC:
65N55Multigrid methods; domain decomposition (BVP of PDE)
65F10Iterative methods for linear systems
65N30Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods (BVP of PDE)
65N12Stability and convergence of numerical methods (BVP of PDE)
65F08Preconditioners for iterative methods
35J25Second order elliptic equations, boundary value problems
35R05PDEs with discontinuous coefficients or data