244 research outputs found
Physics-based balancing domain decomposition by constraints for multi-material problems
The final publication is available at Springer via http://dx.doi.org/10.1007/s10915-018-0870-zIn 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 does not depend on the contrast of the coefficient across subdomains. An extensive set of numerical experiments for 2D and 3D for the Poisson and linear elasticity problems is provided to support our findings. In particular, we show robustness and weak scalability of the new preconditioner variant up to 8232 cores when applied to 3D multi-material problems with the contrast of the physical coefficient up to 108 and more than half a billion degrees of freedom. For the scalability analysis, we have exploited a highly scalable advanced inter-level overlapped implementation of the preconditioner that deals very efficiently with the coarse problem computation. The proposed preconditioner is compared against a state-of-the-art implementation of an adaptive BDDC method in PETSc for thermal and mechanical multi-material problems.Peer ReviewedPostprint (author's final draft
Physics-based balancing domain decomposition by constraints for multi-material problems
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 does not depend on the contrast of the coefficient across subdomains. An extensive set of numerical experiments for 2D and 3D for the Poisson and linear elasticity problems is provided to support our findings. In particular, we show robustness and weak scalability of the new preconditioner variant up to 8232 cores when applied to 3D multi-material problems with the contrast of the physical coefficient up to 108 and more than half a billion degrees of freedom. For the scalability analysis, we have exploited a highly scalable advanced inter-level overlapped implementation of the preconditioner that deals very efficiently with the coarse problem computation. The proposed preconditioner is compared against a state-of-the-art implementation of an adaptive BDDC method in PETSc for thermal and mechanical multi-material problems
On adaptive BDDC for the flow in heterogeneous porous media
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 three steps: the coarse solve is followed by subdomain solves and
last we look for a divergence-free flux correction and pressures using
conjugate gradients with the BDDC preconditioner. Our main contribution is an
application of the adaptive algorithm for selection of flux constraints.
Performance of the method is illustrated on the benchmark problem from the 10th
SPE Comparative Solution Project (SPE 10). Numerical experiments in both 2D and
3D demonstrate that the first two steps of the method exhibit some numerical
upscaling properties, and the adaptive preconditioner in the last step allows a
significant decrease in number of iterations of conjugate gradients at a small
additional cost.Comment: 21 pages, 7 figure
Solution strategies for nonlinear conservation laws
Nonlinear conservation laws form the basis for models for a wide range of physical phenomena. Finding an optimal strategy for solving these problems can be challenging, and a good strategy for one problem may fail spectacularly for others. As different problems have different challenging features, exploiting knowledge about the problem structure is a key factor in achieving an efficient solution strategy. Most strategies found in literature for solving nonlinear problems involve a linearization step, usually using Newton's method, which replaces the original nonlinear problem by an iteration process consisting of a series of linear problems. A large effort is then spent on finding a good strategy for solving these linear problems. This involves choosing suitable preconditioners and linear solvers. This approach is in many cases a good choice and a multitude of different methods have been developed. However, the linearization step to some degree involves a loss of information about the original problem. This is not necessarily critical, but in many cases the structure of the nonlinear problem can be exploited to a larger extent than what is possible when working solely on the linearized problem. This may involve knowledge about dominating physical processes and specifically on whether a process is near equilibrium. By using nonlinear preconditioning techniques developed in recent years, certain attractive features such as automatic localization of computations to parts of the problem domain with the highest degree of nonlinearities arise. In the present work, these methods are further refined to obtain a framework for nonlinear preconditioning that also takes into account equilibrium information. This framework is developed mainly in the context of porous media, but in a general manner, allowing for application to a wide range of problems. A scalability study shows that the method is scalable for challenging two-phase flow problems. It is also demonstrated for nonlinear elasticity problems. Some models arising from nonlinear conservation laws are best solved using completely different strategies than the approach outlined above. One such example can be found in the field of surface gravity waves. For special types of nonlinear waves, such as solitary waves and undular bores, the well-known Korteweg-de Vries (KdV) equation has been shown to be a suitable model. This equation has many interesting properties not typical of nonlinear equations which may be exploited in the solver, and strategies usually reserved to linear problems may be applied. In this work includes a comparative study of two discretization methods with highly different properties for this equation
A fully algebraic and robust two-level Schwarz method based on optimal local approximation spaces
Two-level domain decomposition preconditioners lead to fast convergence and
scalability of iterative solvers. However, for highly heterogeneous problems,
where the coefficient function is varying rapidly on several possibly
non-separated scales, the condition number of the preconditioned system
generally depends on the contrast of the coefficient function leading to a
deterioration of convergence. Enhancing the methods by coarse spaces
constructed from suitable local eigenvalue problems, also denoted as adaptive
or spectral coarse spaces, restores robust, contrast-independent convergence.
However, these eigenvalue problems typically rely on non-algebraic information,
such that the adaptive coarse spaces cannot be constructed from the fully
assembled system matrix. In this paper, a novel algebraic adaptive coarse
space, which relies on the a-orthogonal decomposition of (local) finite element
(FE) spaces into functions that solve the partial differential equation (PDE)
with some trace and FE functions that are zero on the boundary, is proposed. In
particular, the basis is constructed from eigenmodes of two types of local
eigenvalue problems associated with the edges of the domain decomposition. To
approximate functions that solve the PDE locally, we employ a transfer
eigenvalue problem, which has originally been proposed for the construction of
optimal local approximation spaces for multiscale methods. In addition, we make
use of a Dirichlet eigenvalue problem that is a slight modification of the
Neumann eigenvalue problem used in the adaptive generalized Dryja-Smith-Widlund
(AGDSW) coarse space. Both eigenvalue problems rely solely on local Dirichlet
matrices, which can be extracted from the fully assembled system matrix. By
combining arguments from multiscale and domain decomposition methods we derive
a contrast-independent upper bound for the condition number
- …