Parallel Galerkin domain decomposition procedures for wave equation

Parallel Galerkin domain decomposition procedures for wave equation are given. These procedures use implicit method in the sub-domains and simple explicit flux calculation on the inter-boundaries of sub-domains by integral mean method or extrapolation method. Thus, the parallelism can be achieved by these procedures. The explicit nature of the flux prediction induces a time step constraint that is necessary to preserve the stability. L²-norm error estimates are derived for these procedures. Experimental results are presented to confirm the theoretical results.     

A space decomposition method for parabolic equations

A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank–Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(| log τ |) steps of iteration at each time level are needed, where τ is the time-step size. Applications to overlapping domain decomposition and to a two-level method are given for a second-order parabolic equation. The analysis shows that only a one-element overlap is needed. Discussions about iterative and noniterative methods for parabolic equations are presented. A method that combines the two approaches and utilizes some of the good properties of the two approaches is tested numerically. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 27–46, 1998     

Weak Galerkin finite element methods for a fourth order parabolic equation

This paper is devoted to a newly developed weak Galerkin finite element method with the stabilization term for a linear fourth order parabolic equation, where weakly defined Laplacian operator over discontinuous functions is introduced. Priori estimates are developed and analyzed in L² and an H² type norm for both semi‐discrete and fully discrete schemes. And finally, numerical examples are provided to confirm the theoretical results.     

Error estimates for discontinuous Galerkin method for nonlinear parabolic equations

We consider the nonlinear parabolic partial differential equations. We construct a discontinuous Galerkin approximation using a penalty term and obtain an optimal L^∞(L²) error estimate.     

On error estimates for Galerkin spectral discretizations of parabolic problems with nonsmooth initial data

We analyze the Legendre and Chebyshev spectral Galerkin semidiscretizations of a one dimensional homogeneous parabolic problem with nonconstant coefficients. We present error estimates for both smooth and nonsmooth data. In the Chebyshev case a limit in the order of approximation is established. On the contrary, in the Legendre case we find an arbitrary high order of convegence.

     

A multiscale Galerkin method for the hypersingular integral equation reduced by the harmonic equation

The aim of this paper is to investigate the numerical solution of the hypersingular integral equation reduced by the harmonic equation. First, we transform the hypersingular integral equation into 2π-periodic hypersingular integral equation with the map x=cot(θ/2). Second, we initiate the study of the multiscale Galerkin method for the 2π-periodic hypersingular integral equation. The trigonometric wavelets are used as trial functions. Consequently, the 2j+1 × 2j+1 stiffness matrix Kj can be partitioned j×j block matrices. Furthermore, these block matrices are zeros except main diagonal block matrices. These main diagonal block matrices are symmetrical and circulant matrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform and the inverse fast Fourier transform instead of the inverse matrix. Finally, we provide several numerical examples to demonstrate our method has good accuracy even though the exact solutions are multi-peak and almost singular.     

Least-squares Galerkin procedures for parabolic integro-differential equations

Two least-squares Galerkin finite element schemes are formulated to solve parabolic integro-differential equations. The advantage of this method is that it is not subject to the LBB condition. The convergence analysis shows that the least-squares mixed element schemes yield the approximate solution with optimal accuracy in H(div;Ω)×H¹(Ω) and (L²(Ω))²×L²(Ω), respectively.     

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.

     

Galerkin solution of a singular integral equation with constant coefficients

Galerkin methods are used to approximate the singular integral equation

with solution φ having weak singularity at the endpoint −1, where a, b≠0 are constants. In this case φ is decomposed as φ(x)=(1−x)^α(1+x)^βu(x), where β=−α, 0<α<1. Jacobi polynomials are used in the discussions. Under the conditions fH^μ[−1,1] and k(t,x)H^μ,μ[−1,1]×[−1,1], 0<μ<1, the error estimate under a weighted L² norm is O(n^−μ). Under the strengthened conditions f^″H^μ[−1,1] and , 2α−<μ<1, the error estimate under maximum norm is proved to be O(n^2α−−μ+), where , >0 is a small enough constant.     

Parallel algorithms for a singularly perturbed parabolic problem

This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms are established. Numerical results for test problems are presented. © 1999 Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 389–405, 1999     

DOMAIN DECOMPOSITION METHOD FOR PARABOLIC EQUATION ON GENERAL DOMAIN

The nonoxerlapping domain deoomposition method for parabolic partial differential equation on general domain is considered. A kind of domain decomposition that uses the finite element procedure ks given. The problem.over the domains can be implemented on parallel computer. Convergence analysis is also presented.     

Uniqueness of numerical solutions to nonlinear parabolic equations by a fully implicit discontinuous Galerkin method

We prove uniqueness of numerical solutions to nonlinear parabolic equations approximated by a fully implicit interior penalty discontinuous Galerkin (IPDG) method, with a mesh-independent constraint on time step.     

Crank–Nicolson least-squares Galerkin procedures for parabolic integro-differential equations

Two Crank–Nicolson least-squares Galerkin finite element schemes are formulated to solve parabolic integro-differential equations. The advantage of this method is that it is not subject to the LBB condition. The convergence analysis shows that the methods yield the approximate solutions with optimal accuracy in H(div; Ω) × H¹(Ω) and (L²(Ω))² × L²(Ω), respectively. Moreover, the two methods both get the approximate solutions with second-order accuracy in time increment.     

Domain decomposition for a parabolic convection‐diffusion problem

A two‐dimensional convection‐diffusion problem of parabolic type is considered. A multidomain decomposition algorithm with nonoverlapping subdomains based on a upwind scheme and on a piecewise equidistant mesh is investigated. Uniform in a perturbation parameter convergence properties of the algorithm are established. Numerical experiments complement the theoretical results. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Interior penalty discontinuous Galerkin methods with implicit time‐integration techniques for nonlinear parabolic equations

We prove existence and numerical stability of numerical solutions of three fully discrete interior penalty discontinuous Galerkin methods for solving nonlinear parabolic equations. Under some appropriate regularity conditions, we give the l²(H¹) and l^∞(L²) error estimates of the fully discrete symmetric interior penalty discontinuous Galerkin–scheme with the implicit θ ‐schemes in time, which include backward Euler and Crank–Nicolson finite difference approximations. Our estimates are optimal with respect to the mesh size h. The theoretical results are confirmed by some numerical experiments. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A fractional splitting algorithm for nonoverlapping domain decomposition for parabolic problem

In this article we study the convergence of the nonoverlapping domain decomposition for solving large linear system arising from semi‐discretization of two‐dimensional initial value problem with homogeneous boundary conditions and solved by implicit time stepping using first and two alternatives of second‐order FS‐methods. The interface values along the artificial boundary condition line are found using explicit forward Euler's method for the first‐order FS‐method, and for the second‐order FS‐method to use extrapolation procedure for each spatial variable individually. The solution by the nonoverlapping domain decomposition with FS‐method is applicable to problems that requires the solution on nonuniform meshes for each spatial variable, which will enable us to use different time‐stepping over different subdomains and with the possibility of extension to three‐dimensional problem. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 609–624, 2002     

A Schwarz-based domain decomposition method for the dispersion equation

We propose a Schwarz-based domain decomposition method for solving a dispersion equation consisting on the linearized KdV equation without the advective term, using simple interface operators based on the exact transparent boundary conditions for this equation. An optimization process is performed for obtaining the approximation that provides the method with the fastest convergence to the solution of the monodomain problem.     

Parallel split least‐squares mixed finite element method for parabolic problem

Based on overlapping domain decomposition, a new class of parallel split least‐squares (PSLS) mixed finite element methods is presented for solving parabolic problem. The algorithm is fully parallel. In the overlapping domains, the partition of unity is applied to distribute the corrections reasonably, which makes that the new method only needs one or two iteration steps to reach given accuracy at each time step while the classical Schwarz alternating methods need many iteration steps. The dependence of the convergence rate on the spacial mesh size, time increment, iteration times, and subdomains overlapping degree is analyzed. Some numerical results are reported to confirm the theoretical analysis.     

Parallel domain decomposition procedures of improved D-D type for parabolic problems

Two parallel domain decomposition procedures for solving initial-boundary value problems of parabolic partial differential equations are proposed. One is the extended D-D type algorithm, which extends the explicit/implicit conservative Galerkin domain decomposition procedures, given in [5], from a rectangle domain and its decomposition that consisted of a stripe of sub-rectangles into a general domain and its general decomposition with a net-like structure. An almost optimal error estimate, without the factor H^−1/2 given in Dawson-Dupont’s error estimate, is proved. Another is the parallel domain decomposition algorithm of improved D-D type, in which an additional term is introduced to produce an approximation of an optimal error accuracy in L²-norm.     

Nonoverlapping domain decomposition and additive splitting up methods for multidimensional parabolic problem

The explicit implicit domain decomposition methods are noniterative types of methods for nonoverlapping domain decomposition but due to the use of the explicit step for the interface prediction, the methods suffer from inaccuracy of the usual explicit scheme. In this article a specific type of first‐ and second‐order splitting up method, of additive type, for the dependent variables is initially considered to solve the two‐ or three‐dimensional parabolic problem over nonoverlapping subdomains. We have also considered the parallel explicit splitting up algorithm to define (predict) the interface boundary conditions with respect to each spatial variable and for each nonoverlapping subdomains. The parallel second‐order splitting up algorithm is then considered to solve the subproblems defined over each subdomain; the correction step will then be considered for the predicted interface nodal points using the most recent solution values over the subdomains. Finally several model problems will be considered to test the efficiency of the presented algorithm. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006