High order methods on Shishkin meshes for singular perturbation problems of convection–diffusion type

In this paper we construct and analyze two compact monotone finite difference methods to solve singularly perturbed problems of convection–diffusion type. They are defined as HODIE methods of order two and three, i.e., the coefficients are determined by imposing that the local error be null on a polynomial space. For arbitrary meshes, these methods are not adequate for singularly perturbed problems, but using a Shishkin mesh we can prove that the methods are uniformly convergent of order two and three except for a logarithmic factor. Numerical examples support the theoretical results. This revised version was published online in June 2006 with corrections to the Cover Date.     

Parameter-uniform numerical methods for some linear and nonlinear singularly perturbed convection diffusion boundary turning point problems

Both linear and nonlinear singularly perturbed two point boundary value problems are examined in this paper. In both cases, the problems have a boundary turning point and are of convection-diffusion type. Parameter-uniform numerical methods composed of monotone finite difference operators and piecewise-uniform Shishkin meshes, are constructed and analyzed for both the linear and the nonlinear class of problems. Numerical results are presented to illustrate the theoretical parameter-uniform error bounds established.     

A Parameter-Uniform Finite Difference Method for a Coupled System of Convection-Diffusion Two-Point Boundary Value Problems

A system of m (≥2) linear convection-diffusion two-point boundary value problems is examined,where the diffusion term in each equation is multiplied by a small parameterεand the equations are coupled through their convective and reactive terms via matrices B and A respectively.This system is in general singularly perturbed. Unlike the case of a single equation,it does not satisfy a conventional maximum princi- ple.Certain hypotheses are placed on the coupling matrices B and A that ensure exis- tence and uniqueness of a solution to the system and also permit boundary layers in the components of this solution at only one endpoint of the domain;these hypotheses can be regarded as a strong form of diagonal dominance of B.This solution is decomposed into a sum of regular and layer components.Bounds are established on these compo- nents and their derivatives to show explicitly their dependence on the small parameterε.Finally,numerical methods consisting of upwinding on piecewise-uniform Shishkin meshes are proved to yield numerical solutions that are essentially first-order conver- gent,uniformly inε,to the true solution in the discrete maximum norm.Numerical results on Shishkin meshes are presented to support these theoretical bounds.     

Uniform Convergence of Multigrid V-Cycle on Adaptively Refined Finite Element Meshes for Elliptic Problems with Discontinuous Coefficients

The multigrid V-cycle methods for adaptive finite element discretizations of two-dimensional elliptic problems with discontinuous coefficients are considered. Under the conditions that the coefficient is quasi-monotone up to a constant and the meshes are locally refined by using the newest vertex bisection algorithm, some uniform convergence results are proved for the standard multigrid V-cycle algorithm with Gauss-Seidel relaxations performed only on new nodes and their immediate neighbours. The multigrid V-cycle algorithm uses $\mathcal{O}(N)$ operations per iteration and is optimal.     

Uniform Convergence of Adaptive Multigrid Methods for Elliptic Problems and Maxwell's Equations

We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems and Maxwell's equations. The multigrid algorithm only performs pointwise Gauss-Seidel relaxations on new degrees of freedom and their "immediate" neighbors. In the context of lowest order conforming finite element approximations, we present a unified proof for the convergence of adaptive multigrid V-cycle algorithms. The theory applies to any hierarchical tetrahedral meshes with uniformly bounded shape-regularity measures. The convergence rates for both problems are uniform with respect to the number of mesh levels and the number of degrees of freedom. We demonstrate our convergence theory by two numerical experiments.     

Uniformly Convergent Multigrid Methods for Convection–Diffusion Problems without Any Constraint on Coarse Grids

We construct a class of multigrid methods for convection–diffusion problems. The proposed algorithms use first order stable monotone schemes to precondition the second order standard Galerkin finite element discretization. To speed up the solution process of the lower order schemes, cross-wind-block reordering of the unknowns is applied. A V-cycle iteration, based on these algorithms, is then used as a preconditioner in GMRES. The numerical examples show that this method is convergent without imposing any constraint on the coarsest grid and the convergence of the preconditioned method is uniform.     

On the uniform convergence of a finite difference scheme for time dependent singularly perturbed reaction-diffusion problems

In this work we are interested in the numerical approximation of 1D parabolic singularly perturbed problems of reaction-diffusion type. To approximate the multiscale solution of this problem we use a numerical scheme combining the classical backward Euler method and central differencing. The scheme is defined on some special meshes which are the tensor product of a uniform mesh in time and a special mesh in space, condensing the mesh points in the boundary layer regions. In this paper three different meshes of Shishkin, Bahkvalov and Vulanovic type are used, proving the uniform convergence with respect to the diffusion parameter. The analysis of the uniform convergence is based on a new study of the asymptotic behavior of the solution of the semidiscrete problems, which are obtained after the time discretization by the Euler method. Some numerical results are showed corroborating in practice the theoretical results on the uniform convergence and the order of the method.     

A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations

A class of modified block SSOR preconditioners is presented for solving symmetric positive definite systems of linear equations, which arise in the hierarchical basis finite element discretizations of the second order self‐adjoint elliptic boundary value problems. This class of methods is strongly related to two level methods, standard multigrid methods, and Jacobi‐like hierarchical basis methods. The optimal relaxation factors and optimal condition numbers are estimated in detail. Theoretical analyses show that these methods are very robust, and especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes. This revised version was published online in June 2006 with corrections to the Cover Date.     

Scaled discrete derivatives of singularly perturbed elliptic problems

Numerical approximations to the solution of a singularly perturbed elliptic convection–diffusion problem in two space dimensions are generated using a monotone finite difference operator on a tensor product of piecewise‐uniform Shishkin meshes. The bilinear interpolants of these numerical approximations are parameter‐uniformly convergent to the solution of the continuous problem, in the pointwise maximum norm. In this article, discrete approximations to the first derivatives of the solution are shown to be globally first‐order (up to logarithmic factors) uniformly convergent, when the errors are scaled within the analytical layers of the continuous problem. Numerical results are presented to illustrate the theoretical error bounds established in an appropriated weighted C¹–norm. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 225–252, 2015     

Monotone multigrid methods for elliptic variational inequalities II

Summary. We derive globally convergent multigrid methods for discrete elliptic variational inequalities of the second kind as obtained from the approximation of related continuous problems by piecewise linear finite elements. The coarse grid corrections are computed from certain obstacle problems. The actual constraints are fixed by the preceding nonlinear fine grid smoothing. This new approach allows the implementation as a classical V-cycle and preserves the usual multigrid efficiency. We give estimates for the asymptotic convergence rates. The numerical results indicate a significant improvement as compared with previous multigrid approaches. Received March 26, 1994 / Revised version received September 22, 1994     

The necessity of Shishkin decompositions

In the present paper, we study model singularly perturbed convection-diffusion problems with exponential boundary layers. It has been believed for some time that only a complete splitting of the exact solution into regular and layer parts provides the information necessary for the study of the uniform convergence properties of numerical methods for these problems on layer-adapted grids (such as Shishkin meshes). In the present paper, we give new proofs of uniform interpolation error estimates for linear and bilinear interpolation; these proofs are based on the older a priori bounds derived by Kellogg and Tsan [1].     

A singular perturbation approach to solve Burgers–Huxley equation via monotone finite difference scheme on layer-adaptive mesh

This paper deals with a numerical method for solving one-dimensional unsteady Burgers–Huxley equation with the viscosity coefficient ε. The parameter ε takes any values from the half open interval (0, 1]. At small values of the parameter ε, an outflow boundary layer is produced in the neighborhood of right part of the lateral surface of the domain and the problem can be considered as a non-linear singularly perturbed problem with a singular perturbation parameter ε. Using singular perturbation analysis, asymptotic bounds for the derivatives of the solution are established by decomposing the solution into smooth and singular components. We construct a numerical scheme that comprises of implicit-Euler method to discretize in temporal direction on uniform mesh and a monotone hybrid finite difference operator to discretize the spatial variable with piecewise uniform Shishkin mesh. To obtain better accuracy, we use central finite difference scheme in the boundary layer region. Shishkin meshes are refined in the boundary layer region, therefore stability constraint is satisfied by proposed scheme. Quasilinearization process is used to tackle the non-linearity and it is shown that quasilinearization process converges quadratically. The method has been shown to be first order uniformly accurate in the temporal variable, and in the spatial direction it is first order parameter uniform convergent in the outside region of boundary layer, and almost second order parameter uniform convergent in the boundary layer region. Accuracy and uniform convergence of the proposed method is demonstrated by numerical examples and comparison of numerical results made with the other existing methods.     

MULTIGRID METHODS FOR OBSTACLE PROBLEMS

In this review,we intend to clarify the underlying ideas and the relations between various multigrid methods ranging from subset decomposition,to projected subspace decomposition and truncated multigrid.In addition,we present a novel globally convergent inexact active set method which is closely related to truncated multigrid.The numerical properties of algorithms are carefully assessed by means of a degenerate problem and a problem with a complicated coincidence set.     

A parameter robust numerical method for a two dimensional reaction-diffusion problem

In this paper a singularly perturbed reaction-diffusion partial differential equation in two space dimensions is examined. By means of an appropriate decomposition, we describe the asymptotic behaviour of the solution of problems of this kind. A central finite difference scheme is constructed for this problem which involves an appropriate Shishkin mesh. We prove that the numerical approximations are almost second order uniformly convergent (in the maximum norm) with respect to the singular perturbation parameter. Some numerical experiments are given that illustrate in practice the theoretical order of convergence established for the numerical method.

     

A parameter-uniform numerical method for a singularly perturbed two parameter elliptic problem

In this paper, a class of singularly perturbed elliptic partial differential equations posed on a rectangular domain is studied. The differential equation contains two singular perturbation parameters. The solutions of these singularly perturbed problems are decomposed into a sum of regular, boundary layer and corner layer components. Parameter-explicit bounds on the derivatives of each of these components are derived. A numerical algorithm based on an upwind finite difference operator and a tensor product of piecewise-uniform Shishkin meshes is analysed. Parameter-uniform asymptotic error bounds for the numerical approximations are established.     

Uniform methods for semilinear problems with attractive boundary turning points

An upwind finite‐difference scheme for the numerical solution of semilinear convection‐diffusion problems with attractive boundary turning points is considered. We show that the maximum nodal error is bounded by a special weighted ℓ₁‐type norm of the truncation error. This result is used to establish uniform convergence with respect to the perturbation parameter on Shishkin meshes.     

An almost third order finite difference scheme for singularly perturbed reaction-diffusion systems

This paper addresses the numerical approximation of solutions to coupled systems of singularly perturbed reaction-diffusion problems. In particular a hybrid finite difference scheme of HODIE type is constructed on a piecewise uniform Shishkin mesh. It is proved that the numerical scheme satisfies a discrete maximum principle and also that it is third order (except for a logarithmic factor) uniformly convergent, even for the case in which the diffusion parameter associated with each equation of the system has a different order of magnitude. Numerical examples supporting the theory are given.     

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.     

An efficient hierarchical preconditioner for quadratic discretizations of finite element problems

Higher order finite element discretizations, although providing higher accuracy, are considered to be computationally expensive and of limited use for large‐scale problems. In this paper, we have developed an efficient iterative solver for solving large‐scale quadratic finite element problems. The proposed approach shares some common features with geometric multigrid methods but does not need structured grids to create the coarse problem. This leads to a robust method applicable to finite element problems discretized by unstructured meshes such as those from adaptive remeshing strategies. The method is based on specific properties of hierarchical quadratic bases. It can be combined with an algebraic multigrid (AMG) preconditioner or with other algebraic multilevel block factorizations. The algorithm can be accelerated by flexible Krylov subspace methods. We present some numerical results on the convection–diffusion and linear elasticity problems to illustrate the efficiency and the robustness of the presented algorithm. In these experiments, the performance of the proposed method is compared with that of an AMG preconditioner and other iterative solvers. Our approach requires less computing time and less memory storage. Copyright © 2010 John Wiley & Sons, Ltd.     

Parameter uniform approximations for time‐dependent reaction‐diffusion problems

Using discrete Green's functions techniques, we present a classification of fitted mesh methods for time‐dependent reaction diffusion problems, based on the analyses of Linß (Linß, Numer Algor 40 (2005), 23–32) for the analogous steady‐state problem and of Kopteva (Kopteva, Computing 66 (2001), 179–197) for time‐dependent convection‐diffusion problems. As examples of how to apply the analysis, we derive error estimates for the fitted meshes of Shishkin and Bakhvalov, and provide supporting numerical results. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007