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)
A robust preconditioning technique for the extended finite element method. (English) Zbl 1217.74128
Summary: The extended finite element method enhances the approximation properties of the finite element space by using additional enrichment functions. But the resulting stiffness matrices can become ill-conditioned. In that case iterative solvers need a large number of iterations to obtain an acceptable solution. In this paper a procedure is described to obtain stiffness matrices whose condition number is close to the one of the finite element matrices without any enrichments. A domain decomposition is employed and the algorithm is very well suited for parallel computations. The method was tested in numerical experiments to show its effectiveness. The experiments have been conducted for structures containing cracks and material interfaces. We show that the corresponding enrichments can result in arbitrarily ill-conditioned matrices. The method proposed here, however, provides well-conditioned matrices and can be applied to any sort of enrichment. The complexity of this approach and its relation to the domain decomposition is discussed. Computation times have been measured for a structure containing multiple cracks. For this structure the computation times could be decreased by a factor of 2.
MSC:
74S05Finite element methods in solid mechanics
74R10Brittle fracture
Software:
XFEM