Uzawa methods for a class of block three‐by‐three saddle‐point problems

In this work, we consider numerical methods for solving a class of block three‐by‐three saddle‐point problems, which arise from finite element methods for solving time‐dependent Maxwell equations and some other applications. The direct extension of the Uzawa method for solving this block three‐by‐three saddle‐point problem requires the exact solution of a symmetric indefinite system of linear equations at each step. To avoid heavy computations at each step, we propose an inexact Uzawa method, which solves the symmetric indefinite linear system in some inexact way. Under suitable assumptions, we show that the inexact Uzawa method converges to the unique solution of the saddle‐point problem within the approximation level. Two special algorithms are customized for the inexact Uzawa method combining the splitting iteration method and a preconditioning technique, respectively. Numerical experiments are presented, which demonstrated the usefulness of the inexact Uzawa method and the two customized algorithms.     

Gauss‐Lobatto‐Legendre‐Birkhoff pseudospectral approximations for the multi‐term time fractional diffusion‐wave equation with Neumann boundaryconditions

A second‐order finite difference/pseudospectral scheme is proposed for numerical approximation of multi‐term time fractional diffusion‐wave equation with Neumann boundary conditions. The scheme is based upon the weighted and shifted Grünwald difference operators approximation of the time fractional calculus and Gauss‐Lobatto‐Legendre‐Birkhoff (GLLB) pseudospectral method for spatial discretization. The unconditionally stability and convergence of the scheme are rigorously proved. Numerical examples are carried out to verify theoretical results.     

A multilevel characteristics method for periodic convection‐dominated diffusion problems

In this article we introduce a multilevel method in space and time for the approximation of a convection‐diffusion equation. The spatial discretization is of pseudo‐spectral Fourier type, while the time discretization relies on the characteristics method. The approximate solution is obtained as the sum of two components that are advanced in time using different time‐steps. In particular, this requires the introduction of two sets of discretized characteristics curves and of two interpolation operators. We investigate the stability of the scheme and derive some error estimates. They indicate that the high‐frequency term can be integrated with a larger time‐step. Numerical experiments illustrate the gain in computing time due to the multilevel strategy. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 107–132, 2000     

A local defect correction technique for time‐dependent problems

In this article a local defect correction technique for time‐dependent problems is presented. The method is suitable for solving partial differential equations characterized by a high activity, which is mainly located, at each time, in a small part of the physical domain. The problem is solved at each time step by means of a global uniform coarse grid and a local uniform fine grid. Local and global approximation are improved iteratively. Results of numerical experiments illustrate the accuracy, the efficiency, and the robustness of the method. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

An IMEX‐BDF2 compact scheme for pricing options under regime‐switching jump‐diffusion models

In this paper, an implicit‐explicit two‐step backward differentiation formula (IMEX‐BDF2) together with finite difference compact scheme is developed for the numerical pricing of European and American options whose asset price dynamics follow the regime‐switching jump‐diffusion process. It is shown that IMEX‐BDF2 method for solving this system of coupled partial integro‐differential equations is stable with the second‐order accuracy in time. On the basis of IMEX‐BDF2 time semi‐discrete method, we derive a fourth‐order compact (FOC) finite difference scheme for spatial discretization. Since the payoff function of the option at the strike price is not differentiable, the results show only second‐order accuracy in space. To remedy this, a local mesh refinement strategy is used near the strike price so that the accuracy achieves fourth order. Numerical results illustrate the effectiveness of the proposed method for European and American options under regime‐switching jump‐diffusion models.     

Performance and numerical behavior of the second‐order scheme of precise time‐step integration for transient dynamic analysis

Spurious high‐frequency responses resulting from spatial discretization in time‐step algorithms for structural dynamic analysis have long been an issue of concern in the framework of traditional finite difference methods. Such algorithms should be not only numerically dissipative in a controllable manner, but also unconditionally stable so that the time‐step size can be governed solely by the accuracy requirement. In this article, the issue is considered in the framework of the second‐order scheme of the precise integration method (PIM). Taking the Newmark‐β method as a reference, the performance and numerical behavior of the second‐order PIM for elasto‐dynamic impact‐response problems are studied in detail. In this analysis, the differential quadrature method is used for spatial discretization. The effects of spatial discretization, numerical damping, and time step on solution accuracy are explored by analyzing longitudinal vibrations of a shock‐excited rod with rectangular, half‐triangular, and Heaviside step impact. Both the analysis and numerical tests show that under the framework of the PIM, the spatial discretization used here can provide a reasonable number of model types for any given error tolerance. In the analysis of dynamic response, an appropriate spatial discretization scheme for a given structure is usually required in order to obtain an accurate and meaningful numerical solution, especially for describing the fine details of traction responses with sharp changes. Under the framework of the PIM, the numerical damping that is often required in traditional integration schemes is found to be unnecessary, and there is no restriction on the size of time steps, because the PIM can usually produce results with machine‐like precision and is an unconditionally stable explicit method. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A fast second‐order difference scheme for the space–time fractional equation

In this paper, a fast second‐order accurate difference scheme is proposed for solving the space–time fractional equation. The temporal Caputo derivative is approximated by ?L2 ‐1_σ formula which employs the sum‐of‐exponential approximation to the kernel function appeared in Caputo derivative. The second‐order linear spline approximation is applied to the spatial Riemann–Liouville derivative. At each time step, a fast algorithm, the preconditioned conjugate gradient normal residual method with a circulant preconditioner (PCGNR), is used to solve the resulting system that reduces the storage and computational cost significantly. The unique solvability and unconditional convergence of the difference scheme are shown by the discrete energy method. Numerical examples are given to verify numerical accuracy and efficiency of the difference schemes.     

A nonconforming exponentially fitted finite element method for two‐dimensional drift‐diffusion models in semiconductors

A new nonconforming exponentially fitted finite element for a Galerkin approximation of convection–diffusion equations with a dominating advective term is considered. The attention is here focused on the drift‐diffusion current continuity equations in semiconductor device modeling. The scheme extends to the two‐dimensional case, the well known Scharfetter–Gummel method, by imposing a divergence‐free current over each element of the triangulation. Convergence of the method in the energy norm is proved and some numerical results are included. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 133–150, 1999     

Parallel characteristic finite element method for time‐dependent convection–diffusion problem

Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd.     

High order compact solution of the one‐space‐dimensional linear hyperbolic equation

In this article, we introduce a high‐order accurate method for solving one‐space dimensional linear hyperbolic equation. We apply a compact finite difference approximation of fourth order for discretizing spatial derivative of linear hyperbolic equation and collocation method for the time component. The main property of this method additional to its high‐order accuracy due to the fourth order discretization of spatial derivative, is its unconditionally stability. In this technique the solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. Numerical results show that the compact finite difference approximation of fourth order and collocation method produce a very efficient method for solving the one‐space‐dimensional linear hyperbolic equation. We compare the numerical results of this paper with numerical results of (Mohanty, 3 .© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Semi‐implicit schemes for transient Navier–Stokes equations and eddy viscosity models

This study presents two computational schemes for the numerical approximation of solutions to eddy viscosity models as well as transient Navier–Stokes equations. The eddy viscosity model is one example of a class of Large Eddy Simulation models, which are used to simulate turbulent flow. The first approximation scheme is a first order single step method that treats the nonlinear term using a semi‐implicit discretization. The second scheme employs a two step approach that applies a Crank–Nicolson method for the nonlinear term while also retaining the semi‐implicit treatment used in the first scheme. A finite element approximation is used in the spatial discretization of the partial differential equations. The convergence analysis for both schemes is discussed in detail, and numerical results are given for two test problems one of which is the two dimensional flow around a cylinder. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

An optimal‐order estimate for MMOC‐MFEM approximations to porous medium flow

Mathematical models used to describe porous medium flow lead to coupled systems of time‐dependent partial differential equations. Standard methods tend to generate numerical solutions with nonphysical oscillations or numerical dispersion along with spurious grid‐orientation effect. The MMOC‐MFEM time‐stepping procedure, in which the modified method of characteristics (MMOC) is used to solve the transport equation and a mixed finite element method (MFEM) is used for the pressure equation, simulates porous medium flow accurately even if large spatial grids and time steps are used. In this article we prove an optimal‐order error estimate for a family of MMOC‐MFEM approximations. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

An H‐matrix Type Preconditioner For Frictional Contact Problems

The bilateral or unilateral contact problem with Coulomb friction between two elastic bodies is considered [1]. An algorithm is introduced to solve the resulting finite element system by a non‐overlapping domain decomposition method [2, 3]. The global problem is transformed to a independant local problems posed in each bodie and a problem posed on the contact surface (the interface problem). The solution is obtained by using a successive approximation method, in each step of this algorithm we solve two intermediate problems the first with prescribed tangential pressure and the second with prescribed normal pressure [8]. Our preconditioner construction is based on the application of the H‐matrix technique [6, 7] together with the representation of the H^1/2 seminorm by a sum of partial seminorms [4]. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

A combined BDF‐semismooth Newton approach for time‐dependent Bingham flow

This article is devoted to the numerical simulation of time‐dependent convective Bingham flow in cavities. Motivated by a primal‐dual regularization of the stationary model, a family of regularized time‐dependent problems is introduced. Well posedness of the regularized problems is proved, and convergence of the regularized solutions to a solution of the original multiplier system is verified. For the numerical solution of each regularized multiplier system, a fully discrete approach is studied. A stable finite element approximation in space together with a second‐order backward differentiation formula for the time discretization are proposed. The discretization scheme yields a system of Newton differentiable nonlinear equations in each time step, for which a semismooth Newton algorithm is used. We present two numerical experiments to verify the main properties of the proposed approach. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

A moving Kriging‐based MLPG method for nonlinear Klein–Gordon equation

In this paper, the meshless local Petrov–Galerkin approximation is proposed to solve the 2‐D nonlinear Klein–Gordon equation. We used the moving Kriging interpolation instead of the MLS approximation to construct the meshless local Petrov–Galerkin shape functions. These shape functions possess the Kronecker delta function property. The Heaviside step function is used as a test function over the local sub‐domains. Here, no mesh is needed neither for integration of the local weak form nor for construction of the shape functions. So the present method is a truly meshless method. We employ a time‐stepping method to deal with the time derivative and a predictor–corrector scheme to eliminate the nonlinearity. Several examples are performed and compared with analytical solutions and with the results reported in the extant literature to illustrate the accuracy and efficiency of the presented method. Copyright © 2016 John Wiley & Sons, Ltd.     

Orthogonal spline collocation methods for the stream function‐vorticity formulation of the Navier–Stokes equations

An orthogonal spline collocation (OSC) spatial discretization is proposed for the solution of the fully coupled stream function‐vorticity formulation of the Navier–Stokes equations in two dimensions. For the time‐stepping, a three‐level leapfrog scheme is employed. This method is algebraically linear, and, at each time step, gives rise to a system of linear equations of the form arising in the OSC approximation of the biharmonic Dirichlet problem and can be solved by a fast direct method. Error estimates in the H^l–norm in space, l = 1,2, are derived for the semi‐discrete method and the fully‐discrete leapfrog scheme which is also shown to be second order accurate in time. Numerical results are presented which confirm the theoretical analysis and exhibit superconvergence phenomena, which provide superconvergent approximations to the components of the velocity. © John Wiley & Sons, Inc. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Maximum principle for the finite element solution of time‐dependent anisotropic diffusion problems

Preservation of the maximum principle is studied for the combination of the linear finite element method in space and the θ ‐method in time for solving time‐dependent anisotropic diffusion problems. It is shown that the numerical solution satisfies a discrete maximum principle when all element angles of the mesh measured in the metric specified by the inverse of the diffusion matrix are nonobtuse, and the time step size is bounded below and above by bounds proportional essentially to the square of the maximal element diameter. The lower bound requirement can be removed when a lumped mass matrix is used. In two dimensions, the mesh and time step conditions can be replaced by weaker Delaunay‐type conditions. Numerical results are presented to verify the theoretical findings. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

An Eulerian‐Lagrangian control volume scheme for two‐dimensional unsteady advection‐diffusion problems

We develop a mass conservative Eulerian‐Lagrangian control volume scheme (ELCVS) for the solution of the transient advection‐diffusion equations in two space dimensions. This method uses finite volume test functions over the space‐time domain defined by the characteristics within the framework of the class of Eulerian‐Lagrangian localized adjoint characteristic methods (ELLAM). It, therefore, maintains the advantages of characteristic methods in general, and of this class in particular, which include global mass conservation as well as a natural treatment of all types of boundary conditions. However, it differs from other methods in that class in the treatment of the mass storage integrals at the previous time step defined on deformed Lagrangian regions. This treatment is especially attractive for orthogonal rectangular Eulerian grids composed of block elements. In the algorithm, each deformed region is approximated by an eight‐node region with sides drawn parallel to the Eulerian grid, which significantly simplifies the integration compared with the approach used in finite volume ELLAM methods, based on backward tracking, while retaining local mass conservation at no additional expenses in terms of accuracy or CPU consumption. This is verified by numerical tests which show that ELCVS performs as well as standard finite volume ELLAM methods, which have previously been shown to outperform many other well‐received classes of numerical methods for the equations considered. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

An efficient high‐order algorithm for solving systems of reaction‐diffusion equations

An efficient higher‐order finite difference algorithm is presented in this article for solving systems of two‐dimensional reaction‐diffusion equations with nonlinear reaction terms. The method is fourth‐order accurate in both the temporal and spatial dimensions. It requires only a regular five‐point difference stencil similar to that used in the standard second‐order algorithm, such as the Crank‐Nicolson algorithm. The Padé approximation and Richardson extrapolation are used to achieve high‐order accuracy in the spatial and temporal dimensions, respectively. Numerical examples are presented to demonstrate the efficiency and accuracy of the new algorithm. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 340–354, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10012