Unified multipliers‐free theory of dual‐primal domain decomposition methods

The concept of dual‐primal methods can be formulated in a manner that incorporates, as a subclass, the non preconditioned case. Using such a generalized concept, in this article without recourse to “Lagrange multipliers,” we introduce an all‐inclusive unified theory of nonoverlapping domain decomposition methods (DDMs). One‐level methods, such as Schur‐complement and one‐level FETI, as well as two‐level methods, such as Neumann‐Neumann and preconditioned FETI, are incorporated in a unified manner. Different choices of the dual subspaces yield the different dual‐primal preconditioners reported in the literature. In this unified theory, the procedures are carried out directly on the matrices, independently of the differential equations that originated them. This feature reduces considerably the code‐development effort required for their implementation and permit, for example, transforming 2D codes into 3D codes easily. Another source of this simplification is the introduction of two projection‐matrices, generalizations of the average and jump of a function, which possess superior computational properties. In particular, on the basis of numerical results reported there, we claim that our jump matrix is the optimal choice of the B operator of the FETI methods. A new formula for the Steklov‐Poincaré operator, at the discrete level, is also introduced. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Multipliers‐free dual‐primal domain decomposition methods for nonsymmetric matrices and their numerical testing

The most commonly used nonoverlapping domain decomposition algorithms, such as the FETI‐DP and BDDC, require the introduction of discontinuous vector spaces. Most of the works on such methods are based on approaches that originated in Lagrange multipliers formulations. Using a theory of partial differential equations formulated in discontinuous piecewise‐defined functions, introduced and developed by Herrera and his collaborators through a long time span, recently the authors have developed an approach to domain decomposition methods in which general problems with prescribed jumps are treated at the discrete level. This yields an elegant and general direct framework that permits analyzing the problems in greater detail. The algorithms derived using it have properties similar to those of well‐established methods such as FETI‐DP, but, in our experience, they are easier to implement. Also, they yield explicit matrix formulas that unify the different methods. Furthermore, this multipliers‐free framework has permitted us to extend such formulas to make them applicable to nonsymmetric matrices. The extension of the unifying matrix formulas to nonsymmetric matrices is the subject matter of the present article. A conspicuous result is that in numerical experiments in 2D and 3D, the MF‐DP algorithms for nonsymmetric matrices exhibit an efficiency of the same order as state‐of‐the‐art algorithms for symmetric matrices, such as BDDC, FETI‐DP, and MF‐DP.© 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1262‐1289, 2011     

New formulation of iterative substructuring methods without Lagrange multipliers: Neumann–Neumann and FETI

This article is devoted to introduce a new approach to iterative substructuring methods that, without recourse to Lagrange multipliers, yields positive definite preconditioned formulations of the Neumann–Neumann and FETI types. To my knowledge, this is the first time that such formulations have been made without resource to Lagrange multipliers. A numerical advantage that is concomitant to such multipliers‐free formulations is the reduction of the degrees of freedom associated with the Lagrange multipliers. Other attractive features are their generality, directness, and simplicity. The general framework of the new approach is rather simple and stems directly from the discretization procedures that are applied; in it, the differential operators act on discontinuous piecewise‐defined functions. Then, the Lagrange multipliers are not required because in such an environment the functions‐discontinuities are not an anomaly that need to be corrected. The resulting algorithms and equations‐systems are also derived with considerable detail. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Neumann‐Neumann methods for a DG discretization on geometrically nonconforming substructures

A discontinuous Galerkin discretization for second order elliptic equations with discontinuous coefficients in 2D is considered. The domain of interest Ω is assumed to be a union of polygonal substructures Ω_i of size O(H_i). We allow this substructure decomposition to be geometrically nonconforming. Inside each substructure Ω_i, a conforming finite element space associated to a triangulation \begin{align*} {\mathcal{T}}_{h_i}(\Omega_i)\end{align*} is introduced. To handle the nonmatching meshes across ?Ω_i, a discontinuous Galerkin discretization is considered. In this article, additive and hybrid Neumann‐Neumann Schwarz methods are designed and analyzed. Under natural assumptions on the coefficients and on the mesh sizes across ?Ω_i, a condition number estimate \begin{align*} C(1 + \max_i\log \frac{H_i}{h_i})^2\end{align*} is established with C independent of h_i, H_i, h_i/h_j, and the jumps of the coefficients. The method is well suited for parallel computations and can be straightforwardly extended to three dimensional problems. Numerical results are included. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

A balancing domain decomposition by constraints preconditioner for a weakly over‐penalized symmetric interior penalty method

We develop a balancing domain decomposition by constraints preconditioner for a weakly over‐penalized symmetric interior penalty method for second‐order elliptic problems. We show that the condition number of the preconditioned system satisfies similar estimates as those for conforming finite element methods. Corroborating numerical results are also presented. Copyright © 2012 John Wiley & Sons, Ltd.     

An Eulerian‐Lagrangian substructuring domain decomposition method for unsteady‐state advection‐diffusion equations

We develop an Eulerian‐Lagrangian substructuring domain decomposition method for the solution of unsteady‐state advection‐diffusion transport equations. This method reduces to an Eulerian‐Lagrangian scheme within each subdomain and to a type of Dirichlet‐Neumann algorithm at subdomain interfaces. The method generates accurate and stable solutions that are free of artifacts even if large time‐steps are used in the simulation. Numerical experiments are presented to show the strong potential of the method. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17:565–583, 2001     

Augmented hybrid finite element method for domain decomposition

We present an Augmented Hybrid Finite Element Method for Domain Decompositon. In this method, finite element approximations are defined independently on each subdomain and do not match at interface. This dows the user to mda local change of design, of meshes on one aubdomain without modifying other subdomains. Optimal reaults are obtained for a second-order model problem.     

Theory of differential equations in discontinuous piecewise‐defined functions

A truly general and systematic theory of finite element methods (FEM) should be formulated using, as trial and test functions, piecewise‐defined functions that can be fully discontinuous across the internal boundary, which separates the elements from each other. Some of the most relevant work addressing such formulations is contained in the literature on discontinuous Galerkin (dG) methods and on Trefftz methods. However, the formulations of partial differential equations in discontinuous functions used in both of those fields are indirect approaches, which are based on the use of Lagrange multipliers and mixed methods, in the case of dG methods, and the frame, in the case of Trefftz method. This article addresses this problem from a different point of view and proposes a theory, formulated in discontinuous piecewise‐defined functions, which is direct and systematic, and furthermore it avoids the use of Lagrange multipliers or a frame, while mixed methods are incorporated as particular cases of more general results implied by the theory. When boundary value problems are formulated in discontinuous functions, well‐posed problems are boundary value problems with prescribed jumps (BVPJ), in which the boundary conditions are complemented by suitable jump conditions to be satisfied across the internal boundary of the domain‐partition. One result that is presented in this article shows that for elliptic equations of order 2m, with m ≥ 1, the problem of establishing conditions for existence of solution for the BVPJ reduces to that of the “standard boundary value problem,” without jumps, which has been extensively studied. Actually, this result is an illustration of a more general one that shows that the same happens for any differential equation, or system of such equations that is linear, independently of its type and with possibly discontinuous coefficients. This generality is achieved by means of an algebraic framework previously developed by the author and his collaborators. A fundamental ingredient of this algebraic formulation is a kind of Green's formulas that simplify many problems (some times referred to as Green‐Herrera formulas). An important practical implication of our approach is worth mentioning: “avoiding the introduction of the Lagrange multipliers, or the ‘frame’ in the case of Trefftz‐methods, significantly reduces the number of degrees of freedom to be dealt with.” © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Neumann–Neumann waveform relaxation algorithm in multiple subdomains for hyperbolic problems in 1D and 2D

We present a Waveform Relaxation (WR) version of the Neumann–Neumann algorithm for the wave equation in space‐time. The method is based on a nonoverlapping spatial domain decomposition, and the iteration involves subdomain solves in space‐time with corresponding interface conditions, followed by a correction step. Using a Fourier‐Laplace transform argument, for a particular relaxation parameter, we prove convergence of the algorithm in a finite number of steps for the finite time intervals. The number of steps depends on the size of the subdomains and the time window length on which the algorithm is employed. We illustrate the performance of the algorithm with numerical results, followed by a comparison with classical and optimized Schwarz WR methods. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 514–530, 2017     

A Neumann–Neumann algorithm for a mortar finite element discretization of fourth‐order elliptic problems in 2D

Here we present and analyze a Neumann–Neumann algorithm for the mortar finite element discretization of elliptic fourth‐order problems with discontinuous coefficients. The fully parallel algorithm is analyzed using the abstract Schwarz framework, proving a convergence which is independent of the parameters of the problem, and depends only logarithmically on the ratio between the subdomain size and the mesh size.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

An overlapping domain decomposition preconditioner for a class of discontinuous Galerkin approximations of advection-diffusion problems

We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.

     

Lagrangian formulation of domain decomposition methods: A unified theory

Domain decomposition methods based on one Lagrange multiplier have been shown to be very efficient for solving ill-conditioned problems in parallel. Several variants of these methods have been developed in the last ten years. These variants are based on an augmented Lagrangian formulation involving one or two Lagrange multipliers and on mixed type interface conditions between the sub-domains. In this paper, the Lagrangian formulations of some of these domain decomposition methods are presented both from a continuous and a discrete point of view.     

A coarse–fine‐mesh stabilization for an alternating Schwarz domain decomposition method

Domain decomposition methods can be solved in various ways. In this paper, domain decomposition in strips is used. It is demonstrated that a special version of the Schwarz alternating iteration method coupled with coarse–fine‐mesh stabilization leads to a very efficient solver, which is easy to implement and has a behavior nearly independent of mesh and problem parameters. The novelty of the method is the use of alternating iterations between odd‐ and even‐numbered subdomains and the replacement of the commonly used coarse‐mesh stabilization method with coarse–fine‐mesh stabilization.     

A characteristic domain decomposition and space–time local refinement method for first‐order linear hyperbolic equations with interfaces

We develop a characteristic‐based domain decomposition and space–time local refinement method for first‐order linear hyperbolic equations. The method naturally incorporates various physical and numerical interfaces into its formulation and generates accurate numerical solutions even if large time‐steps are used. The method fully utilizes the transient and strongly local behavior of the solutions of hyperbolic equations and provides solutions with significantly improved accuracy and efficiency. Several numerical experiments are presented to illustrate the performance of the method and for comparison with other domain decomposition and local refinement schemes. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 1–28, 1999     

Domain Decomposition Preconditioners for Discontinuous Galerkin Discretizations of Compressible Fluid Flows

In this article we consider the application of Schwarz-type domain decomposition preconditioners to the discontinuous Galerkin finite element approximation of the compressible Navier-Stokes equations. To discretize this system of conservation laws, we exploit the (adjoint consistent) symmetric version of the interior penalty discontinuous Galerkin finite element method. To define the necessary coarse-level solver required for the definition of the proposed preconditioner, we exploit ideas from composite finite element methods, which allow for the definition of finite element schemes on general meshes consisting of polygonal (agglomerated) elements. The practical performance of the proposed preconditioner is demonstrated for a series of viscous test cases in both two- and three-dimensions.     

Primal‐dual active set methods for Allen–Cahn variational inequalities with nonlocal constraints

We propose and analyze a primal‐dual active set method for discretized versions of the local and nonlocal Allen–Cahn variational inequalities. An existence result for the nonlocal variational inequality is shown in a formulation involving Lagrange multipliers for local and nonlocal constraints. Local convergence of the discrete method is shown by interpreting the approach as a semismooth Newton method. Properties of the method are discussed and several numerical simulations demonstrate its efficiency. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A CFL‐free explicit characteristic interior penalty scheme for linear advection‐reaction equations

We develop a CFL‐free, explicit characteristic interior penalty scheme (CHIPS) for one‐dimensional first‐order advection‐reaction equations by combining a Eulerian‐Lagrangian approach with a discontinuous Galerkin framework. The CHIPS method retains the numerical advantages of the discontinuous Galerkin methods as well as characteristic methods. An optimal‐order error estimate in the L² norm for the CHIPS method is derived and numerical experiments are presented to confirm the theoretical estimates. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

A regularized domain decomposition method with Lagrange multiplier

In this paper, we are concerned with the nonoverlapping domain decomposition method with Lagrange multiplier for three-dimensional second-order elliptic problems with no zeroth-order term. It is known that the methods result in a singular subproblem on each internal (floating) subdomain. To handle the singularity, we propose a regularization technique which transforms the corresponding singular problems into approximate positive definite problems. For the regularized method, one can build the interface equation of the multiplier directly. We first derive an optimal error estimate of the regularized approximation, and then develop a cheap preconditioned iterative method for solving the interface equation. For the new method, the cost of computation will not be increased comparing the case without any floating subdomain. The effectiveness of the new method will be confirmed by both theoretical analyzes and numerical experiments. The work is supported by Natural Science Foundation of China G10371129.     

Local preconditioners for two‐level non‐overlapping domain decomposition methods

We consider additive two‐level preconditioners, with a local and a global component, for the Schur complement system arising in non‐overlapping domain decomposition methods. We propose two new parallelizable local preconditioners. The first one is a computationally cheap but numerically relevant alternative to the classical block Jacobi preconditioner. The second one exploits all the information from the local Schur complement matrices and demonstrates an attractive numerical behaviour on heterogeneous and anisotropic problems. We also propose two implementations based on approximate Schur complement matrices that are cheaper alternatives to construct the given preconditioners but that preserve their good numerical behaviour. Through extensive computational experiments we study the numerical scalability and the robustness of the proposed preconditioners and compare their numerical performance with well‐known robust preconditioners such as BPS and the balancing Neumann–Neumann method. Finally, we describe a parallel implementation on distributed memory computers of some of the proposed techniques and report parallel performances. Copyright © 2001 John Wiley & Sons, Ltd.     

An efficient explicit/implicit domain decomposition method for convection‐diffusion equations

A nonoverlapping domain decomposition method for some time‐dependent convection‐diffusion equations is presented. It combines predictor‐corrector technique, modified upwind differences with explicit/implicit coupling to provide intrinsic parallelism, and unconditional stability while improving the accuracy. Both rigorous mathematical analysis and numerical experiments are carried out to illustrate the stability, accuracy, and parallelism. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010