Related papers: A BDDC method with an adaptive coarse space for th…
We study a method based on Balancing Domain Decomposition by Constraints (BDDC) for a numerical solution of a single-phase flow in heterogenous porous media. The method solves for both flux and pressure variables. The fluxes are resolved in…
The balancing domain decomposition methods (BDDC) are originally introduced for symmetric positive definite systems and have been extended to the nonsymmetric positive definite system from the linear finite element discretization of…
The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism…
A balancing domain decomposition by constraints (BDDC) algorithm with adaptive primal constraints in variational form is introduced and analyzed for high-order mortar discretization of two-dimensional elliptic problems with high varying and…
We extend the Balancing Domain Decomposition by Constraints (BDDC) method to flows in porous media discretised by mixed-hybrid finite elements with combined mesh dimensions. Such discretisations appear when major geological fractures are…
We propose a Nested BDDC for a class of saddle-point problems. The method solves for both flux and pressure variables. The fluxes are resolved in three-steps: the coarse solve is followed by subdomain solves, and last we look for a…
Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS) discritization of Helmholtz equations with…
In this paper, we consider the balancing domain decomposition by constraints (BDDC) algorithm with adaptive coarse spaces for a class of stochastic elliptic problems. The key ingredient in the construction of the coarse space is the…
We study the effect of adaptive mesh refinement on a parallel domain decomposition solver of a linear system of algebraic equations. These concepts need to be combined within a parallel adaptive finite element software. A prototype…
This paper concerns the use of asymptotic expansions for the efficient solving of forward and inverse problems involving a nonlinear singularly perturbed time-dependent reaction--diffusion--advection equation. By using an asymptotic…
Physical models with uncertain inputs are commonly represented as parametric partial differential equations (PDEs). That is, PDEs with inputs that are expressed as functions of parameters with an associated probability distribution.…
In this paper, we are concerned with the weighted plane wave least-squares (PWLS) method for three-dimensional Helmholtz equations, and develop the multi-level adaptive BDDC algorithms for solving the resulting discrete system. In order to…
This work focuses on numerically solving a shape identification problem related to advection-diffusion processes with space-dependent coefficients using shape optimization techniques. Two boundary-type cost functionals are considered, and…
BDDC method is the most advanced method from the Balancing family of iterative substructuring methods for the solution of large systems of linear algebraic equations arising from discretization of elliptic boundary value problems. In the…
We present a robust computational framework for advective-diffusive-reactive systems that satisfies maximum principles, the non-negative constraint, and element-wise species balance property. The proposed methodology is valid on general…
In this paper, we establish the convergence of the proximal alternating direction method of multipliers (ADMM) and block coordinate descent (BCD) for nonseparable minimization models with quadratic coupling terms. The novel convergence…
This paper develops an adaptive proximal alternating direction method of multipliers (ADMM) for solving linearly constrained, composite optimization problems under the assumption that the smooth component of the objective is weakly convex,…
In application of the Balancing Domain Decomposition by Constraints (BDDC) to a case with many substructures, solving the coarse problem exactly becomes the bottleneck which spoils scalability of the solver. However, it is straightforward…
Block coordinate descent (BCD) methods and their variants have been widely used in coping with large-scale nonconstrained optimization problems in many fields such as imaging processing, machine learning, compress sensing and so on. For…
Diffusion models have become a successful approach for solving various image inverse problems by providing a powerful diffusion prior. Many studies tried to combine the measurement into diffusion by score function replacement, matrix…