Domain decomposition methods

Known as: Domain decomposition method, Iterative substructuring methods, Iterative substructuring 
In mathematics, numerical analysis, and numerical partial differential equations, domain decomposition methods solve a boundary value problem by… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider additive Schwarz domain decomposition preconditioners for piecewise linear finite element approximations of elliptic… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2004
Highly Cited
2004
A domain decomposition method using optimal transmission condition was presented. Nonconforming discretization between different… (More)
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Imagine that you get such certain awesome experience and knowledge by only reading a book. How can? It seems to be greater when a… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Citation for published version (APA): Brincker, R., Zhang, L., & Andersen, P. (2000). Modal Identification of Output-Only Systems… (More)
  • figure 1
  • figure 2
  • figure 5
  • table 1
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Domain decomposition methods are iterative methods for the solution of linear or nonlinear systems that use explicit information… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Numerical experiments have shown that two-level Schwarz methods often perform very well even if the overlap between neighboring… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Neumann-Neumann algorithm is known to be an eecient domain decomposition preconditioner with unstructured subdomains for… (More)
Is this relevant?