Balancing domain decomposition method

Known as: Balancing domain decomposition 
In numerical analysis, the balancing domain decomposition method (BDD) is an iterative method to find the solution of a symmetric positive definite… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2016
02419932016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In this paper we present a detailed description of a high-performance distributedmemory implementation of balancing domain… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • table 4.1
  • table 4.2
Is this relevant?
2009
2009
A variant of balancing domain decomposition method by constraints (BDDC) is proposed for solving a class of indefinite systems of… (More)
  • figure 4.1
  • table 7.1
  • table 7.2
  • table 7.3
  • table 7.4
Is this relevant?
2007
2007
This paper describes the parallel finite element analysis of large scale problems based on the Domain Decomposition Method with… (More)
  • table 1
  • table 3
  • table 2
  • figure 1
  • figure 3
Is this relevant?
2007
2007
The balancing domain decomposition methods by constraints are extended to solving nonsymmetric, positive definite linear systems… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2007
2007
The rate of convergence of the Balancing Domain Decomposition method applied to the mixed finite element discretization of second… (More)
Is this relevant?
2004
2004
The domain decomposition method (DDM) is a major solution algorithm in order to parallelize the finite element method. In case of… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
The balancing domain decomposition method for mixed finite elements by Cowsar, Mandel, and Wheeler is extended to the case of… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
1994
1994
We show that the Neumann-Neumann preconditioner with a coarse problem can be applied to the solution of a system of linear… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Neumann-Neumann algorithm is known to be an e cient domain decomposition preconditioner with unstructured subdomains for… (More)
  • table 1
Is this relevant?