A stable noniterative Prediction/Correction domain decomposition method for hyperbolic problems

In this paper, a noniterative domain decomposition algorithm for solving hyperbolic partial differential equations is presented. The algorithm includes a prediction to estimate the values at the interface and these values are corrected by a scheme that improves the accuracy. It has been shown that the algorithm is unconditionally stable. Efficiency is analyzed in terms of speedup and operation ratio. Numerical experiments illustrate that the method is stable and efficient.     

A characteristic nonoverlapping domain decomposition method for multidimensional convection‐diffusion equations

We develop a quasi‐two‐level, coarse‐mesh‐free characteristic nonoverlapping domain decomposition method for unsteady‐state convection‐diffusion partial differential equations in multidimensional spaces. The development of the domain decomposition method is carried out by utilizing an additive Schwarz domain decomposition preconditioner, by using an Eulerian‐Lagrangian method for convection‐diffusion equations and by delicately choosing appropriate interface conditions that fully respect and utilize the hyperbolic nature of the governing equations. Numerical experiments are presented to illustrate the method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Numerical solution to a linearized KdV equation on unbounded domain

Exact absorbing boundary conditions for a linearized KdV equation are derived in this paper. Applying these boundary conditions at artificial boundary points yields an initial‐boundary value problem defined only on a finite interval. A dual‐Petrov‐Galerkin scheme is proposed for numerical approximation. Fast evaluation method is developed to deal with convolutions involved in the exact absorbing boundary conditions. In the end, some numerical tests are presented to demonstrate the effectiveness and efficiency of the proposed method.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Parallel Galerkin domain decomposition procedures for parabolic equation on general domain

Parallel Galerkin domain decomposition procedures for parabolic equation on general domain are given. These procedures use implicit Galerkin method in the subdomains and simple explicit flux calculation on the interdomain boundaries by integral mean method or extrapolation method to predict the inner‐boundary conditions. Thus, the parallelism can be achieved by these procedures. These procedures are conservative both in the subdomains and across interboundaries. The explicit nature of the flux prediction induces a time‐step limitation that is necessary to preserve stability, but this constraint is less severe than that for a fully explicit method. L²‐norm error estimates are derived for these procedures. Compared with the work of Dawson and Dupont [Math Comp 58 (1992), 21–35], these L²‐norm error estimates avoid the loss of H^?1/2 factor. Experimental results are presented to confirm the theoretical results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Discrete artificial boundary conditions for the linearized Korteweg–de Vries equation

We consider the derivation of continuous and fully discrete artificial boundary conditions for the linearized Korteweg–de Vries equation. We show that we can obtain them for any constant velocities and any dispersion. The discrete artificial boundary conditions are provided for two different numerical schemes. In both continuous and discrete case, the boundary conditions are nonlocal with respect to time variable. We propose fast evaluations of discrete convolutions. We present various numerical tests which show the effectiveness of the artificial boundary conditions.© 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1455–1484, 2016     

The Lions domain decomposition algorithm on non-matching cell-centred finite volume meshes

A finite volume scheme for convection diffusion equations onnon-matching grids is presented. Sharp error estimates for H²solutions of the continuous problem are obtained. A finite volumeversion of an adaptation of the Schwarz algorithm due to P.L. Lions is then studied. For a fixed mesh, its convergencetowards the finite volume scheme on the whole domain is proven.Numerical experiments are performed to illustrate the theoreticalrate of convergence of the finite volume sequences of solutionsas the mesh is refined, together with the speed of convergenceof the Schwarz algorithm.     

An efficient domain decomposition method for three-dimensional parabolic problems

A non-overlapping domain decomposition algorithm to solve three-dimensional parabolic partial differential equations is presented. It has been shown in this paper that the algorithm is unconditionally stable and efficient. Spectral radii for the interface and interior region are provided. Unlike two-dimensional problem, it has been found out that estimating the values of the points of the interface in three-dimensional problem is no longer negligible.     

A fast numerical method for a natural boundary integral equation for the Helmholtz equation

A Neumann boundary value problem of the Helmholtz equation in the exterior circular domain is reduced into an equivalent natural boundary integral equation. Using our trigonometric wavelets and the Galerkin method, the obtained stiffness matrix is symmetrical and circulant, which lead us to a fast numerical method based on fast Fourier transform. Furthermore, we do not need to compute the entries of the stiffness matrix. Especially, our method is also efficient when the wave number k in the Helmholtz equation is very large.     

An interval arithmetic domain decomposition method for a class of elliptic PDEs on nonrectangular domains

We introduce an interval arithmetic domain decomposition method for linear systems with interval coefficients resulting from the application of difference methods for a class of elliptic boundary value problems on domains with irregular geometry. The efficient treatment of such systems is crucial for the efficiency of globally convergent Newton-like interval methods for the corresponding nonlinear problems.     

Homotopy perturbation method for fractional KdV equation

In this paper, the homotopy perturbation method is directly applied to derive approximate solutions of the fractional KdV equation. The results reveal that the proposed method is very effective and simple for solving approximate solutions of fractional differential equations.     

A conservative parallel difference method for 2-dimension diffusion equation

In this paper, a conservative parallel difference scheme, which is based on domain decomposition method, for 2-dimension diffusion equation is proposed. In the construction of this scheme, we use the numerical solution on the previous time step to give a weighted approximation of the numerical flux. Then the sub-problems with Neumann boundary are computed by fully implicit scheme. What is more, only local message communication is needed in the program. We use the method of discrete functional analysis to give the proof of the unconditional stability and second-order convergence accuracy. Some numerical tests are given to verify the theory results.     

Differential quadrature domain decomposition method for problems on a triangular domain

The differential quadrature method (DQM) has been studied for years and it has been shown by many researchers that the DQM is an attractive numerical method with high efficiency and accuracy. The conventional DQM is mostly effective for one‐dimensional and multidimensional problems with geometrically regular domains. But to deal with problems on a triangular domain, we will meet difficulties. In this article we will study how to solve problems on a triangular domain by using DQM combined with the domain decomposition method (DDM). © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

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.     

Adaptive wavelet frame domain decomposition methods for nonlinear elliptic equations

In this article, we are concerned with the numerical treatment of nonlinear elliptic boundary value problems. Our method of choice is a domain decomposition strategy. Partially following the lines from (Cohen, Dahmen and deVore, SIAM J Numer Anal 41 (2003), 1785–1823; Kappei, Appl Anal J Sci 90 (2011), 1323–1353; Lui, SIAM J Sci Comput 21 (2000), 1506–1523; Stevenson and Werner, Math Comp 78 (2009), 619–644), we develop an adaptive additive Schwarz method using wavelet frames. We show that the method converges with an asymptotically optimal rate and support our theoretical results with numerical tests in one and two space dimensions. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

A non-homogeneous boundary-value problem for the KdV–Burgers equation posed on a finite domain

We consider the initial–boundary value problem for the KdV–Burgers equation posed on a bounded interval $[a,b]$. This problem features non-homogeneous boundary conditions applied at $x=a$ and $x=b$ and is known to have unique global smooth solution.     

A segmented and weighted Adomian decomposition algorithm for boundary value problem of nonlinear groundwater equation

Based on Adomian decomposition method, a new algorithm for solving boundary value problem (BVP) of nonlinear partial differential equations on the rectangular area is proposed. The solutions obtained by the method precisely satisfy all boundary conditions, except the small pieces near the four corners of the rectangular area. A theorem on the boundary error is given. Hence, the Adomian decomposition method is more efficiently applied to BVPs for partial differential equations. Segmented and weighted analytical solutions with a high accuracy for the BVP of nonlinear groundwater equations on a rectangular area are obtained by the present algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

A new analytical and numerical treatment for singular two-point boundary value problems via the Adomian decomposition method

Based on the Adomian decomposition method, a new analytical and numerical treatment is introduced in this research to investigate linear and non-linear singular two-point BVPs. The effectiveness of the proposed approach is verified by several linear and non-linear examples.     

Uzawa block relaxation domain decomposition method for a two-body frictionless contact problem

We propose a Uzawa block relaxation domain decomposition method for a two-body frictionless contact problem. We introduce auxiliary variables to separate subdomains representing linear elastic bodies. Applying a Uzawa block relaxation algorithm to the corresponding augmented Lagrangian functional yields a domain decomposition algorithm in which we have to solve two uncoupled linear elasticity subproblems in each iteration while the auxiliary variables are computed explicitly using Kuhn–Tucker optimality conditions.     

Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem

This paper deals with iterative algorithms for domain decomposition applied to the solution of a quasilinear elliptic problem. Two iterative algorithms are examined: the first one is the Schwarz alternating procedure and the second algorithm is suitable for parallel computing. Convergence results are established in the two-domain and multidomain decomposition cases. Some issues of parallel implementation of these algorithms are discussed.     

Local well-posedness for the dispersion generalized periodic KdV equation

In this paper, we set up the local well-posedness of the initial value problem for the dispersion generalized periodic KdV equation: t_∂u+x_∂α|Dx|u=x_∂u², u(0)=φ for α>2, and φ∈Hs(T). And we show that the is a lower endpoint to obtain the bilinear estimates (1.2) and (1.3) which are the crucial steps to obtain the local well-posedness by Picard iteration. The case α=2 was studied in Kenig et al. (1996) [10].