ANALYSIS OF WAVEGUIDE PROBLEMS USING A RELAXED ITERATIVE DOMAIN DECOMPOSITION METHOD COMBINED WITH MULTIFRONTAL ALGORITHM

In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.

A Fully Nonlinear HOBEM with the Domain Decomposition Method for Simulation of Wave Propagation and Diffraction

A higher-order boundary element method(HOBEM) for simulating the fully nonlinear regular wave propagation and diffraction around a fixed vertical circular cylinder is investigated. The domain decomposition method with continuity conditions enforced on the interfaces between the adjacent sub-domains is implemented for reducing the computational cost. By adjusting the algorithm of iterative procedure on the interfaces, four types of coupling strategies are established, that is, Dirchlet/Dirchlet-Neumman/Neumman(D/D-N/N), Dirchlet-Neumman(D-N),Neumman-Dirchlet(N-D) and Mixed Dirchlet-Neumman/Neumman-Dirchlet(Mixed D-N/N-D). Numerical simulations indicate that the domain decomposition methods can provide accurate results compared with that of the single domain method. According to the comparisons of computational efficiency, the D/D-N/N coupling strategy is recommended for the wave propagation problem. As for the wave-body interaction problem, the Mixed D-N/N-D coupling strategy can obtain the highest computational efficiency.

Modified domain decomposition method for Hamilton-Jacobi-Bellman equations

This paper presents a modified domain decomposition method for the numerical solution of discrete Hamilton-Jacobi-Bellman equations arising from a class of optimal control problems using diffusion models. A convergence theorem is established. Numerical results indicate the effectiveness and accuracy of the method.

DOMAIN DECOMPOSITION METHODS FOR SOLVING PDE's ON MULTI-PROCESSORS

In this paper, we discuss the parallel domain decomposition method(DDM)for solving PDE's on parallel computers. Three types of DDM: DDM with overlapping, DDM without overlapping and DDM with fictitious component are discussed in a uniform framework. The eonvergence of the asynchronous parallel algorithms based on DDM are discussed.

Iterative Pure Source Transfer Domain Decomposition Methods for Helmholtz Equations in Heterogeneous Media

We extend the pure source transfer domain decomposition method(PSTDDM)to solve the perfectly matched layer approximation of Helmholtz scattering problems in heterogeneous media.We first propose some new source transfer operators,and then introduce the layer-wise and block-wise PSTDDMs based on these operators.In particular,it is proved that the solution obtained by the layer-wise PSTDDM in R2 coincides with the exact solution to the heterogeneous Helmholtz problem in the computational domain.Second,we propose the iterative layer-wise and blockwise PSTDDMs,which are designed by simply iterating the PSTDDM alternatively over two staggered decompositions of the computational domain.Finally,extensive numerical tests in two and three dimensions show that,as the preconditioner for the GMRES method,the iterative PSTDDMs are more robust and efficient than PSTDDMs for solving heterogeneous Helmholtz problems.

Deep Domain Decomposition Methods:Helmholtz Equation

This paper proposes a deep-learning-based Robin-Robin domain decomposition method(DeepDDM)for Helmholtz equations.We first present the plane wave activation-based neural network(PWNN),which is more efficient for solving Helmholtz equations with constant coefficients and wavenumber k than finite difference methods(FDM).On this basis,we use PWNN to discretize the subproblems divided by domain decomposition methods(DDM),which is the main idea of DeepDDM.This paper will investigate the number of iterations of using DeepDDM for continuous and discontinuous Helmholtz equations.The results demonstrate that:DeepDDM exhibits behaviors consistent with conventional robust FDM-based domain decomposition method(FDM-DDM)under the same Robin parameters,i.e.,the number of iterations by DeepDDM is almost the same as that of FDM-DDM.By choosing suitable Robin parameters on different subdomains,the convergence rate is almost constant with the rise of wavenumber in both continuous and discontinuous cases.The performance of DeepDDM on Helmholtz equations may provide new insights for improving the PDE solver by deep learning.

Optimal Boundary Control Method for Domain Decomposition Algorithm

To study the domain decomposition algorithms for the equations of elliptic type, the method of optimal boundary control was used to advance a new procedure for domain decomposition algorithms and regularization method to deal with the ill posedness of the control problem. The determination of the value of the solution of the partial differential equation on the interface——the key of the domain decomposition algorithms——was transformed into a boundary control problem and the ill posedness of the control problem was overcome by regularization. The convergence of the regularizing control solution was proven and the equations which characterize the optimal control were given therefore the value of the unknown solution on the interface of the domain would be obtained by solving a series of coupling equations. Using the boundary control method the domain decomposion algorithm can be carried out.

A Robin-Robin Domain Decomposition Method for a Stokes-Darcy Structure Interaction with a Locally Modified Mesh

A new numerical method based on locally modified Cartesian meshes is proposed for solving a coupled system of a fluid flow and a porous media flow.The fluid flow is modeled by the Stokes equations while the porous media flow is modeled by Darcy’s law.The method is based on a Robin-Robin domain decomposition method with a Cartesian mesh with local modifications near the interface.Some computational examples are presented and discussed.

AN ITERATIVE PROCEDURE FOR DOMAIN DECOMPOSITION METHOD OF SECOND ORDER ELLIPTIC PROBLEM WITH MIXED BOUNDARY CONDITIONS

This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann condition on the another part of boundary). For the pure Dirichlet problem, Marini and Quarteroni [3], [4] considered a similar approach, which is extended to more complex problem in this paper.

Domain Decomposition Method for a System of Quasivariational Inequalities

We propose a domain decomposition method for a system of quasivariational inequalities related to the HJB equation. The monotone convergence of the algorithm is also established.

Domain Decomposition Method for the Forward-Backward Heat Equation

The forward-backward heat equation arises in a remarkable variety of physical applications. A non-overlaping domain decomposition method was constructed to obtain numerical solutions of the forward-backward heat equation. The primary advantage is that the method reduces the computation time tremendously. The convergence of the given method is established. The numerical performance shows that the domain decomposition method is effective.

NONOVERLAPPING DOMAIN DECOMPOSITION METHOD WITH MIXED ELEMENT FOR ELLIPTIC PROBLEMS

In this paper we consider the nonoverlapping domain decomposition method based on mixed element approximation for elliptic problems in two dimentional space. We give a kind of discrete domain decomposition iterative algorithm using mixed finite element, the subdomain problems of which can be implemented parallelly. We also give the existence, uniqueness and convergence of the approximate solution.

THE OPTIMAL PRECONDITIONING IN THE DOMAIN DECOMPOSITION METHOD FOR WILSON ELEMENT

This paper discusses the optimal preconditioning in the domain decomposition method for Wilson element. The process of the preconditioning is composed of the resolution of a small scale global problem based on a coarser grid and a number of independent local subproblems, which can be chosen arbitrarily. The condition number of the preconditioned system is estimated by some characteristic numbers related to global and local subproblems. With a proper selection, the optimal preconditioner can be obtained, while the condition number is independent of the scale of the problem and the number of subproblems.

A COMBINED TECHNIQUE FOR SOLUTION OF PDE＇s VIA THE GENERALIZED DOMAIN DECOMPOSITION METHOD

The Domain Decomposition Method(DDM) is a powerful approach to solving maily types of PDE's. DDM is especially suitable for massively Parallel computers. In the past, most research on DDM has focused on the domain splitting technique. In this paper. we focus our attention on use of a combination of techniques to solve each subproblem. The central question with DDM is that of how to doal with the pseodoboundary conditions. Here, we introduce a set of operators which act on the pseudo-boundaries in the solution process, referring to this new. procedure as the 'Generalized Domain Decomposition A.Jlethod(GDDM).' We have already obtained convergence factors for GDDM with certain classes of PDE's. These ctonvergence factors show that we can derive exact solutions of the whole problem for certain types of PDE's, and can get superior speed of convergence for other types.

THE ANALYSIS OF THE SEPARATED LAYERS ALGORITHM BY DOMAIN DECOMPOSITION METHOD

From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.

TRACE AVERAGING DOMAIN DECOMPOSITION METHOD WITH NONCONFORMING FINITE ELEMENTS

We consider, in this paper, the trace averaging domain decomposition method for the second order self-adjoint elliptic problems discretized by a class of nonconforming finite elements, which is only continuous at the nodes of the quasi-uniform mesh. We show its geometric convergence and present the dependence of the convergence factor on the relaxation factor, the subdomain diameter H and the mesh parameter h. In essence;, this method is equivalent to the simple iterative method for the preconditioned capacitance equation. The preconditioner implied in this iteration is easily invertible and can be applied to preconditioning the capacitance matrix with the condition number no more than O((1 + In H/h)max(1 + H-2, 1 + In H/h)).

The Monotone Robin-Robin Domain Decomposition Methods for the Elliptic Problems with Stefan-Boltzmann Conditions

This paper is concerned with the elliptic problems with nonlinear StefanBoltzmann boundary condition.By combining with the monotone method,the RobinRobin domain decomposition methods are proposed to decouple the nonlinear interface and boundary condition.The monotone properties are verified for both the multiplicative and the additive domain decomposition methods.The numerical results confirm the theoretical analysis.

A DISTRIBUTED LATTICE BOLTZMANN METHOD

In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distributed lattice Boltzmann method are analyzed.

Corrected explicit-implicit domain decomposition algorithms for two-dimensional semilinear parabolic equations

Corrected explicit-implicit domain decomposition(CEIDD) algorithms are studied for parallel approximation of semilinear parabolic problems on distributed memory processors. It is natural to divide the spatial domain into some smaller parallel strips and cells using the simplest straightline interface(SI) . By using the Leray-Schauder fixed-point theorem and the discrete energy method,it is shown that the resulting CEIDD-SI algorithm is uniquely solvable,unconditionally stable and convergent. The CEIDD-SI method always suffers from the globalization of data communication when interior boundaries cross into each other inside the domain. To overcome this disadvantage,a composite interface(CI) that consists of straight segments and zigzag fractions is suggested. The corresponding CEIDD-CI algorithm is proven to be solvable,stable and convergent. Numerical experiments are presented to support the theoretical results.

A PARALLEL ITERATIVE DOMAIN DECOMPOSITION ALGORITHM FOR ELLIPTIC PROBLEMS

An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments arc conducted to show the effectiveness of the method.