In this work, we present a new variant of the balancing domain decomposition by constraints preconditioner that is robust for multi-material problems. We start with a well-balanced subdomain partition, and based on an aggregation of elements according to their physical coefficients, we end up with a finer physics-based (PB) subdomain partition. Next, we define corners, edges, and faces for this PB partition, and select some of them to enforce subdomain continuity (primal faces/edges/corners). When the physical coefficient in each PB subdomain is constant and the set of selected primal faces/edges/corners satisfy a mild condition on the existence of acceptable paths, we can show both theoretically and numerically that the condition number do...
In this paper, we formulate and analyze a perturbed formulation of the balancing domain decompositio...
We analyze two‐level overlapping Schwarz domain decomposition methods for vector‐valued piecewise li...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10915-018-0870-zIn thi...
In this work we propose a novel parallelization approach of two-level balancing domain decomposition...
In this work, we present scalable balancing domain decomposition by constraints methods for linear s...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
The application behind the subject of this thesis are multiscale simulations on highly heterogeneous...
We describe a parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) me...
We describe a parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) me...
A fair comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an appr...
The application behind the subject of this thesis are multiscale simulations on highly heterogeneous...
A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of su...
In this paper, we formulate and analyze a perturbed formulation of the balancing domain decompositio...
We analyze two‐level overlapping Schwarz domain decomposition methods for vector‐valued piecewise li...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10915-018-0870-zIn thi...
In this work we propose a novel parallelization approach of two-level balancing domain decomposition...
In this work, we present scalable balancing domain decomposition by constraints methods for linear s...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
A comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an approxima...
The application behind the subject of this thesis are multiscale simulations on highly heterogeneous...
We describe a parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) me...
We describe a parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) me...
A fair comparison of three Balancing Domain Decomposition by Constraints (BDDC) methods with an appr...
The application behind the subject of this thesis are multiscale simulations on highly heterogeneous...
A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of su...
In this paper, we formulate and analyze a perturbed formulation of the balancing domain decompositio...
We analyze two‐level overlapping Schwarz domain decomposition methods for vector‐valued piecewise li...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...