Skip to search formSkip to main contentSkip to account menu

BDDC

Known as: Balancing Domain Decomposition by Constraints 
In numerical analysis, BDDC (balancing domain decomposition by constraints) is a domain decomposition method for solving large symmetric, positive… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Balancing domain decomposition methodCoarse space (numerical analysis)Condition numberConjugate gradient method

Broader (1)

Domain decomposition methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
PI controlled Bi-directional DC-DC converter (BDDDC) and highly efficient boost converter for electric vehicles
Due to the constraint of the fuel, the electric vehicle is designed for the modern world. Bidirectional DC to DC converters… 
Highly Cited
2016
Highly Cited
2016
PCBDDC: A Class of Robust Dual-Primal Methods in PETSc
A class of preconditioners based on balancing domain decomposition by constraints methods is introduced in the Portable… 
2013
2013
Quasi-optimality of BDDC Methods for MITC Reissner-Mindlin Problems
The goal of this paper is to improve a condition number bound proven in [5] for a Balancing Domain DecompositionMethod by… 
Highly Cited
2009
Highly Cited
2009
Variational theory and domain decomposition for nonlocal problems
2008
2008
A three-level BDDC algorithm for a saddle point problem
BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and… 
Highly Cited
2007
Highly Cited
2007
An approximate BDDC preconditioner
The balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each… 
Highly Cited
2007
Highly Cited
2007
Three‐level BDDC in two dimensions
Balancing Domain Decomposition by Constraints (BDDC) methods are non‐overlapping iterative substructuring domain decomposition… 
Highly Cited
2007
Highly Cited
2007
Multispace and multilevel BDDC
The Balancing Domain Decomposition by Constraints (BDDC) method is the most advanced method from the Balancing family of… 
Highly Cited
2006
Highly Cited
2006
FETI‐DP, BDDC, and block Cholesky methods
The FETI‐DP and BDDC algorithms are reformulated using Block Cholesky factorizations, an approach which can provide a useful… 
Highly Cited
2005
Highly Cited
2005
An algebraic theory for primal and dual substructuring methods by constraints
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)