On Schwarz Alternating Methods for the Subsonic Full Potential Equation

The Schwarz alternating method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the subdomains. The full potential equation is derived from the Navier–Stokes equations assuming the fluid is compressible, inviscid, irrotational and isentropic. It is being used by the aircraft industry to model flow over an airfoil or even an entire aircraft. This paper shows that the additive and multiplicative versions of the Schwarz alternating method, when applied to the full potential equation in three dimensions, converge to the true solution geometrically. The assumptions are that the initial guess and the true solution are everywhere subsonic. We use the convergence proof by Tai and Xu and modify it for certain closed convex subsets.     

Schwarz alternating domain decomposition approach for the solution of two‐dimensional Navier–Stokes flow problems by the method of approximate particular solutions

The method of approximate particular solutions (MAPS) is used to solve the two‐dimensional Navier–Stokes equations. This method uses particular solutions of a nonhomogeneous Stokes problem, with the multiquadric radial basis function as a nonhomogeneous term, to approximate the velocity and pressure fields. The continuity equation is not explicitly imposed since the used particular solutions are mass conservative. To improve the computational efficiency of the global MAPS, the domain is split into overlapped subdomains where the Schwarz Alternating Algorithm is employed using velocity or traction values from neighboring subdomains as boundary conditions. When imposing only velocity boundary conditions, an extra step is required to find a reference value for the pressure at each subdomain to guarantee continuity of pressure across subdomains. The Stokes lid‐driven cavity flow problem is solved to assess the performance of the Schwarz algorithm in comparison to a finite‐difference‐type localized MAPS. The Kovasznay flow problem is used to validate the proposed numerical scheme. Despite the use of relative coarse nodal distributions, numerical results show excellent agreement with respect to results reported in literature when solving the lid‐driven cavity (up to Re = 10,000) and the backward facing step (at Re = 800) problems. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 777–797, 2015     

Analysis of non-overlapping domain decomposition algorithms with inexact solves

In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The preconditioners are developed using uniform preconditioners on the subdomains instead of exact solves. They exhibit the same asymptotic condition number growth as the corresponding preconditioners with exact subdomain solves and are much more efficient computationally. Moreover, this asymptotic condition number growth is bounded independently of jumps in the operator coefficients across subdomain boundaries. We also show that our preconditioners fit into the additive Schwarz framework with appropriately chosen subspace decompositions. Condition numbers associated with the new algorithms are computed numerically in several cases and compared with those of the corresponding algorithms in which exact subdomain solves are used.

     

Multigrid method for coupled semilinear elliptic equation

This paper introduces a kind of multigrid finite element method for the coupled semilinear elliptic equations. Instead of the common way of directly solving the coupled semilinear elliptic problems on some fine spaces, the presented method transforms the solution of the coupled semilinear elliptic problem into a series of solutions of the corresponding decoupled linear boundary value problems on the sequence of multilevel finite element spaces and some coupled semilinear elliptic problems on a very low dimensional space. The decoupled linearized boundary value problems can be solved by some multigrid iterations efficiently. The optimal error estimate and optimal computational work are proved theoretically and demonstrated numerically. Moreover, the requirement of bounded second‐order derivatives of the nonlinear term in the existing multigrid method is reduced to a Lipschitz continuous condition in the proposed method.     

Convergence and comparison analysis of some numerical Schwarz methods

Summary Domain decomposition methods are a natural means for solving partial differential equations on multi-processors. The spatial domain of the equation is expressed as a collection of overlapping subdomains and the solution of an associated equation is solved on each of these subdomains. The global solution is then obtained by piecing together the subsolutions in some manner. For elliptic equations, the global solution is obtained by iterating on the subdomains in a fashion that resembles the classical Schwarz alternating method. In this paper, we examine the convergence behavior of different subdomain iteration procedures as well as different subdomain approximations. For elliptic equations, it is shown that certain iterative procedures are equivalent to block Gauss-Siedel and Jacobi methods. Using different subdomain approximations, an inner-outer iterative procedure is defined.M-matrix analysis yields a comparison of different inner-outer iterations.Dedicated to the memory of Peter HenriciThis work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48     

On the geometric convergence of optimized Schwarz methods with applications to elliptic problems

The Schwarz method can be used for the iterative solution of elliptic boundary value problems on a large domain Ω. One subdivides Ω into smaller, more manageable, subdomains and solves the differential equation in these subdomains using appropriate boundary conditions. Optimized Schwarz Methods use Robin conditions on the artificial interfaces for information exchange at each iteration, and for which one can optimize the Robin parameters. While the convergence theory of classical Schwarz methods (with Dirichlet conditions on the artificial interface) is well understood, the overlapping Optimized Schwarz Methods still lack a complete theory. In this paper, an abstract Hilbert space version of the Optimized Schwarz Method (OSM) is presented, together with an analysis of conditions for its geometric convergence. It is also shown that if the overlap is relatively uniform, these convergence conditions are met for Optimized Schwarz Methods for two-dimensional elliptic problems, for any positive Robin parameter. In the discrete setting, we obtain that the convergence factor ρ(h) varies like a polylogarithm of h. Numerical experiments show that the methods work well and that the convergence factor does not appear to depend on h.     

Multidomain direct method and its applicability to the local time-step concept

A new multidomain direct (noniterative) method for solving boundary-value problems is presented. Using this method, the solution is expressed by a linear combination of auxiliary functions and unknowns which pertain to the boundaries of a subdomain. This approach enables us to solve problems independently and exactly, without any iterations between subdomains. As a consequence, different types of equations and coordinate systems may be considered in different subdomains. Moreover, different boundary conditions and variable (in space) time steps may be imposed on the subdomains as well. Applications are given for initial boundary-value problems with known analytical solutions, including a highly nonlinear porosity equation. © 1994 John Wiley & Sons, Inc.     

A parameter-uniform Schwarz method for a coupled system of reaction–diffusion equations

We consider an arbitrarily sized coupled system of one-dimensional reaction–diffusion problems that are singularly perturbed in nature. We describe an algorithm that uses a discrete Schwarz method on three overlapping subdomains, extending the method in [H. MacMullen, J.J.H. Miller, E. O’Riordan, G.I. Shishkin, A second-order parameter-uniform overlapping Schwarz method for reaction-diffusion problems with boundary layers, J. Comput. Appl. Math. 130 (2001) 231–244] to a coupled system. On each subdomain we use a standard finite difference operator on a uniform mesh. We prove that when appropriate subdomains are used the method produces ε-uniform results. Furthermore we improve upon the analysis of the above-mentioned reference to show that, for small ε, just one iteration is required to achieve the expected accuracy.     

Analysis of a nonoverlapping domain decomposition method for elliptic partial differential equations

In this study we analyze a nonoverlapping domain decomposition method for the solution of elliptic Partial Differential Equation (PDE) problems. This domain decomposition method involves the solution of Dirichlet and Neumann PDE problems on each subdomain, coupled with smoothing operations on the interfaces of the subdomains. The convergence analysis of the method at the differential equation level is presented. The numerical results confirm the theoretical ones and exhibit the computational efficiency of the method.     

一维高精度离散GDQ方法

GDQ method is a kind of high order accurate numerical methods developed several years ago, which have been successfully used to simulate the solution of smooth engineering problems such as structure mechanics and incompressible fluid dynamics. In this paper, extending the traditional GDQ method, we develop a new kind of discontinuous GDQ methods to solve compressible flow problems of which solutions may be discontinuous. In order to capture the local features of fluid flows, firstly, the computational domain is divided into many small pieces of subdomains. Then, in each small subdomain, the GDQ method is implementedand some kinds of numerical flux limitation conditions will be required to keep the correct flow direction. At the boundary interface between subdomains, we also use some kind of flux conditions according to the flow direction. The numerical method obtained by the above steps has the advantages of high order accuracy and easy to treat boundary conditions. It can simulate perfectly nonlinear waves such as shock, rarefaction wave and contact discontinuity. Finally, the numerical experiments on one dimensional Burgers equation and Euler equations are given.The numerical results verify the validation of the method.     

On the numerical solution of singular two‐point boundary value problems: A domain decomposition homotopy perturbation approach

This paper reports a modified homotopy perturbation algorithm, called the domain decomposition homotopy perturbation method (DDHPM), for solving two‐point singular boundary value problems arising in science and engineering. The essence of the approach is to split the domain of the problem into a number of nonoverlapping subdomains. In each subdomain, a method based on a combination of HPM and integral equation formalism is implemented. The boundary condition at the right endpoint of each inner subdomain is established before deriving an iterative scheme for the components of the solution series. The accuracy and efficiency of the DDHPM are demonstrated by 4 examples (2 nonlinear and 2 linear). In comparison with the traditional HPM, the proposed domain decomposition HPM is highly accurate.     

A full multigrid method for semilinear elliptic equation

A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and semilinear problems on a very low dimensional space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient numerical methods can also serve as the linear solver for solving boundary value problems. The optimality of the computational work is also proved. Compared with the existing multigrid methods which need the bounded second order derivatives of the nonlinear term, the proposed method only needs the Lipschitz continuation in some sense of the nonlinear term.     

Schwarz problem for higher‐order complex partial differential equations in the upper half plane

Linear and nonlinear elliptic complex partial differential equations of higher‐order are considered under Schwarz conditions in the upper‐half plane. Firstly, using the integral representations for the solutions of the inhomogeneous polyanalytic equation with Schwarz conditions, a class of integral operators is introduced together with some of their properties. Then, these operators are used to transform the problem for linear equations into singular integral equations. In the case of nonlinear equations such a transformation yields a system of integro‐differential equations. Existence of the solutions of the relevant boundary value problems for linear and nonlinear equations are discussed via Fredholm theory and fixed point theorems, respectively.     

A method for solving an exterior three-dimensional boundary value problem for the Laplace equation

We develop and experimentally study the algorithms for solving three-dimensionalmixed boundary value problems for the Laplace equation in unbounded domains. These algorithms are based on the combined use of the finite elementmethod and an integral representation of the solution in a homogeneous space. The proposed approach consists in the use of the Schwarz alternating method with consecutive solution of the interior and exterior boundary value problems in the intersecting subdomains on whose adjoining boundaries the iterated interface conditions are imposed. The convergence of the iterative method is proved. The convergence rate of the iterative process is studied analytically in the case when the subdomains are spherical layers with the known exact representations of all consecutive approximations. In this model case, the influence of the algorithm parameters on the method efficiency is analyzed. The approach under study is implemented for solving a problem with a sophisticated configuration of boundaries while using a high precision finite elementmethod to solve the interior boundary value problems. The convergence rate of the iterations and the achieved accuracy of the computations are illustrated with some numerical experiments.     

Convergence of a substructuring method with Lagrange multipliers

Summary. We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains plus a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number , or ,where is the characteristic element size and subdomain size. Received January 3, 1995     

One‐step boundary knot method for discontinuous coefficient elliptic equations with interface jump conditions

This study makes the first attempt to apply the boundary knot method (BKM), a meshless collocation method, to the solution of linear elliptic problems with discontinuous coefficients, also known as the elliptic interface problems. The additional jump conditions are usually required to be prescribed at the interface which is used to maintain the well‐posedness of the considered problem. To solve the problem efficiently, the original governing equation is first transformed into an equivalent inhomogeneous modified Helmholtz equation in the present numerical formulation. Then the computational domain is divided into several subdomains, and the solution on each subdomain is approximated using the BKM approach. Unlike the conventional two‐step BKM, this study presents a one‐step BKM formulation which possesses merely one influence matrix for inhomogeneous problems. Several benchmark examples with various discontinuous coefficients have been tested to demonstrate the accuracy and efficiency of the present BKM scheme. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1509–1534, 2016     

Solving the 2-D elliptic Monge-Ampère equation by a Kansa’s method

In this paper, a Kansa’s method is designed to solve numerically the Monge-Ampère equation. The primitive Kansa’s method is a meshfree method which applying the combination of some radial basis functions (such as Hardy’s MQ) to approximate the solution of the linear parabolic, hyperbolic and elliptic problems. But this method is deteriorated when is used to solve nonlinear partial differential equations. We approximate the solution in some local triangular subdomains by using the combination of some cubic polynomials. Then the given problems can be computed in each subdomains independently. We prove the stability and convergence of the new method for the elliptic Monge-Ampère equation. Finally, some numerical experiments are presented to demonstrate the theoretical results.     

Non‐linear initial boundary value problems of hyperbolic–parabolic type. A general investigation of admissible couplings between systems of higher order. Part 3: applications

This is the third part of an article that is devoted to the theory of non‐linear initial boundary value problems. We consider coupled systems where each system is of higher order and of hyperbolic or parabolic type. Our goal is to characterize systematically all admissible couplings between systems of higher order and different type. By an admissible coupling we mean a condition that guarantees the existence, uniqueness and regularity of solutions to the respective initial boundary value problem. In part 1, we develop the underlying theory of linear hyperbolic and parabolic initial boundary value problems. Testing the PDEs with suitable functions we obtain a priori estimates for the respective solutions. In particular, we make use of the regularity theory for linear elliptic boundary value problems that was previously developed by the author. In part 2, we prove the local in time existence, uniqueness and regularity of solutions to quasilinear initial boundary value problems using the so‐called energy method. In the above sense the regularity assumptions about the coefficients and right‐hand sides define the admissible couplings. In part 3 at hand, we extend the results of part 2 to the nonlinear initial boundary value problem (4.2). In particular, assumptions (B8) and (B9) about the respective parameters correspond to the previous regularity assumptions and hence define the admissible couplings now. Moreover, we exploit assumptions (B8) and (B9) for the case of two coupled systems. Copyright © 2002 John Wiley & Sons, Ltd.     

A spatial domain decomposition method for parabolic optimal control problems

We present a non-overlapping spatial domain decomposition method for the solution of linear–quadratic parabolic optimal control problems. The spatial domain is decomposed into non-overlapping subdomains. The original parabolic optimal control problem is decomposed into smaller problems posed on space–time cylinder subdomains with auxiliary state and adjoint variables imposed as Dirichlet boundary conditions on the space–time interface boundary. The subdomain problems are coupled through Robin transmission conditions. This leads to a Schur complement equation in which the unknowns are the auxiliary state adjoint variables on the space-time interface boundary. The Schur complement operator is the sum of space–time subdomain Schur complement operators. The application of these subdomain Schur complement operators is equivalent to the solution of an subdomain parabolic optimal control problem. The subdomain Schur complement operators are shown to be invertible and the application of their inverses is equivalent to the solution of a related subdomain parabolic optimal control problem. We introduce a new family of Neumann–Neumann type preconditioners for the Schur complement system including several different coarse grid corrections. We compare the numerical performance of our preconditioners with an alternative approach recently introduced by Benamou.     

Two-level additive Schwarz preconditioners for C 0 interior penalty methods

We study two-level additive Schwarz preconditioners that can be used in the iterative solution of the discrete problems resulting from C⁰ interior penalty methods for fourth order elliptic boundary value problems. We show that the condition number of the preconditioned system is bounded by C(1+(H³/δ³)), where H is the typical diameter of a subdomain, δ measures the overlap among the subdomains and the positive constant C is independent of the mesh sizes and the number of subdomains. This work was supported in part by the National Science Foundation under Grant No. DMS-03-11790.