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)
Incorporation of linear multipoint constraints in substructure based iterative solvers. I: A numerically scalable algorithm. (English) Zbl 0944.74071
Summary: We consider the iterative solution by a class of substructuring methods for large-scale systems of equations arising from the finite element discretization of structural models with an arbitrary set of linear multipoint constraints. We present a methodology for generalizing to such problems numerically scalable substructure based iterative solvers, without interfering with their formulations and their well-established local and global preconditioners. We apply this methodology to the FETI method, and show that the resulting algorithm is numerically scalable with respect to both the substructure and problem sizes.
74S05Finite element methods in solid mechanics
74K99Thin bodies, structures (solid mechanics)
65F10Iterative methods for linear systems