A Two‐Parameter Stabilized Finite Element Method for Incompressible Flows

Based on two‐grid discretizations, a two‐parameter stabilized finite element method for the steady incompressible Navier–Stokes equations at high Reynolds numbers is presented and studied. In this method, a stabilized Navier–Stokes problem is first solved on a coarse grid, and then a correction is calculated on a fine grid by solving a stabilized linear problem. The stabilization term for the nonlinear Navier–Stokes equations on the coarse grid is based on an elliptic projection, which projects higher‐order finite element interpolants of the velocity into a lower‐order finite element interpolation space. For the linear problem on the fine grid, either the same stabilization approach (with a different stabilization parameter) as that for the coarse grid problem or a completely different stabilization approach could be employed. Error bounds for the discrete solutions are estimated. Algorithmic parameter scalings of the method are also derived. The theoretical results show that, with suitable scalings of the algorithmic parameters, this method can yield an optimal convergence rate. Numerical results are provided to verify the theoretical predictions and demonstrate the effectiveness of the proposed method. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 425–444, 2017     

Local interpolants for Numerov‐type methods and their implementation in variable step schemes

The classical explicit fourth‐order Numerov‐type method is considered. The equations of condition for deriving the corresponding interpolants are given. Then using a local error estimation, we may construct a stable variable step scheme. Applying this new implementation in a set of problems, we get very pleasant results.     

Finite element method for two‐dimensional time‐fractional tricomi‐type equations

In this article, we consider the finite element method (FEM) for two‐dimensional linear time‐fractional Tricomi‐type equations, which is obtained from the standard two‐dimensional linear Tricomi‐type equation by replacing the first‐order time derivative with a fractional derivative (of order α, with 1 <α< 2 ). The method is based on finite element method for space and finite difference method for time. We prove that the method is unconditionally stable, and the error estimate is presented. The comparison of the FEM results with the exact solutions is made, and numerical experiments reveal that the FEM is very effective. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

Strang‐type preconditioners applied to ordinary and neutral differential‐algebraic equations

This paper deals with boundary‐value methods (BVMs) for ordinary and neutral differential‐algebraic equations. Different from what has been done in Lei and Jin (Lecture Notes in Computer Science, vol. 1988. Springer: Berlin, 2001; 505–512), here, we directly use BVMs to discretize the equations. The discretization will lead to a nonsymmetric large‐sparse linear system, which can be solved by the GMRES method. In order to accelerate the convergence rate of GMRES method, two Strang‐type block‐circulant preconditioners are suggested: one is for ordinary differential‐algebraic equations (ODAEs), and the other is for neutral differential‐algebraic equations (NDAEs). Under some suitable conditions, it is shown that the preconditioners are invertible, the spectra of the preconditioned systems are clustered, and the solution of iteration converges very rapidly. The numerical experiments further illustrate the effectiveness of the methods. Copyright © 2011 John Wiley & Sons, Ltd.     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Conditional Lie‐Bäcklund Symmetry of Evolution System and Application for Reaction‐Diffusion System

Conditional Lie‐Bäcklund symmetry (CLBS) method is developed to study system of evolution equations. It is shown that reducibility of a system of evolution equations to a system of ordinary differential equations can be fully characterized by the CLBS of the considered system. As an application of the approach, a class of two‐component nonlinear diffusion equations is studied. The governing system and the admitted CLBS can be identified. As a consequence, exact solutions defined on the polynomial, exponential, trigonometric, and mixed invariant subspaces are constructed due to the corresponding symmetry reductions.     

A new approach by two‐dimensional wavelets operational matrix method for solving variable‐order fractional partial integro‐differential equations

In this paper, a new computational scheme based on operational matrices (OMs) of two‐dimensional wavelets is proposed for the solution of variable‐order (VO) fractional partial integro‐differential equations (PIDEs). To accomplish this method, first OMs of integration and VO fractional derivative (FD) have been derived using two‐dimensional Legendre wavelets. By implementing two‐dimensional wavelets approximations and the OMs of integration and variable‐order fractional derivative (VO‐FD) along with collocation points, the VO fractional partial PIDEs are reduced into the system of algebraic equations. In addition to this, some useful theorems are discussed to establish the convergence analysis and error estimate of the proposed numerical technique. Furthermore, computational efficiency and applicability are examined through some illustrative examples.     

Numerical scheme for solving system of fractional partial differential equations with Volterra‐type integral term through two‐dimensional block‐pulse functions

In the current study, an approximate scheme is established for solving the fractional partial differential equations (FPDEs) with Volterra integral terms via two‐dimensional block‐pulse functions (2D‐BPFs). According to the definitions and properties of 2D‐BPFs, the original problem is transformed into a system of linear algebra equations. By dispersing the unknown variables for these algebraic equations, the numerical solutions can be obtained. Besides, the proof of the convergence of this system is given. Finally, several numerical experiments are presented to test the feasibility and effectiveness of the proposed method.     

A Jacobi–Davidson method for two‐real‐parameter nonlinear eigenvalue problems arising from delay‐differential equations

The critical delays of a delay‐differential equation can be computed by solving a nonlinear two‐parameter eigenvalue problem. The solution of this two‐parameter problem can be translated to solving a quadratic eigenvalue problem of squared dimension. We present a structure preserving QR‐type method for solving such quadratic eigenvalue problem that only computes real‐valued critical delays; that is, complex critical delays, which have no physical meaning, are discarded. For large‐scale problems, we propose new correction equations for a Newton‐type or Jacobi–Davidson style method, which also forces real‐valued critical delays. We present three different equations: one real‐valued equation using a direct linear system solver, one complex valued equation using a direct linear system solver, and one Jacobi–Davidson style correction equation that is suitable for an iterative linear system solver. We show numerical examples for large‐scale problems arising from PDEs. Copyright © 2012 John Wiley & Sons, Ltd.     

A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain

A new shift‐adaptive meshfree method for solving a class of time‐dependent partial differential equations (PDEs) in a bounded domain (one‐dimensional domain) with moving boundaries and nonhomogeneous boundary conditions is introduced. The radial basis function (RBF) collocation method is combined with the finite difference scheme, because, unlike with Kansa's method, nonlinear PDEs can be converted to a system of linear equations. The grid‐free property of the RBF method is exploited, and a new adaptive algorithm is used to choose the location of the collocation points in the first time step only. In fact, instead of applying the adaptive algorithm on the entire domain of the problem (like with other existing adaptive algorithms), the new adaptive algorithm can be applied only on time steps. Furthermore, because of the radial property of the RBFs, the new adaptive strategy is applied only on the first time step; in the other time steps, the adaptive nodes (obtained in the first time step) are shifted. Thus, only one small system of linear equations must be solved (by LU decomposition method) rather than a large linear or nonlinear system of equations as in Kansa's method (adaptive strategy applied to entire domain), or a large number of small linear systems of equations in the adaptive strategy on each time step. This saves a lot in time and memory usage. Also, Stability analysis is obtained for our scheme, using Von Neumann stability analysis method. Results show that the new method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution, and the adaptive grading scheme is effective in localizing oscillations due to sharp gradients or discontinuities in the solution. The efficiency and effectiveness of the proposed procedure is examined by adaptively solving two difficult benchmark problems, including a regularized long‐wave equation and a Korteweg‐de Vries problem. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1622–1646, 2016     

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.     

A uniform estimate for the MMOC for two‐dimensional advection‐diffusion equations

We prove an optimal‐order error estimate in a weighted energy norm for the modified method of characteristics (MMOC) and the modified method of characteristics with adjusted advection (MMOCAA) for two‐dimensional time‐dependent advection‐diffusion equations, in the sense that the generic constants in the estimates depend on certain Sobolev norms of the true solution but not on the scaling diffusion parameter ε. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems

In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low‐dimensional differential Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.     

Numerical solutions of the space‐time fractional advection‐dispersion equation

Fractional advection‐dispersion equations are used in groundwater hydrologhy to model the transport of passive tracers carried by fluid flow in a porous medium. In this paper we present two reliable algorithms, the Adomian decomposition method and variational iteration method, to construct numerical solutions of the space‐time fractional advection‐dispersion equation in the form of a rabidly convergent series with easily computable components. The fractional derivatives are described in the Caputo sense. Some examples are given. Numerical results show that the two approaches are easy to implement and accurate when applied to space‐time fractional advection‐dispersion equations. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

A two‐grid characteristic finite volume element method for semilinear advection‐dominated diffusion equations

A two‐grid finite volume element method, combined with the modified method of characteristics, is presented and analyzed for semilinear time‐dependent advection‐dominated diffusion equations in two space dimensions. The solution of a nonlinear system on the fine‐grid space (with grid size h) is reduced to the solution of two small (one linear and one nonlinear) systems on the coarse‐grid space (with grid size H) and a linear system on the fine‐grid space. An optimal error estimate in H¹ ‐norm is obtained for the two‐grid method. It shows that the two‐grid method achieves asymptotically optimal approximation, as long as the mesh sizes satisfy h = O(H²). Numerical example is presented to validate the usefulness and efficiency of the method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

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.     

Local radial basis function interpolation method to simulate 2D fractional‐time convection‐diffusion‐reaction equations with error analysis

In this article, a kind of meshless local radial point interpolation (MLRPI) method is proposed to two‐dimensional fractional‐time convection‐diffusion‐reaction equations and satisfactory agreements are archived. This method is based on meshless methods and benefits from collocation ideas but it does not belong to the traditional global meshless collocation methods. In MLRPI method, it does not need any kind of integration locally or globally over small quadrature domains which is essential in the finite element method and those meshless methods based on Galerkin weak form. Also, it is not needed to determine shape parameter which plays important role in collocation method based on the radial basis functions (Kansa's method). Therefore, computational costs of this kind of MLRPI method is less expensive. The stability and convergence of this meshless approach are discussed and theoretically proven. It is proved that the present meshless formulation is very effective for modeling and simulation of fractional differential equations. Furthermore, the numerical studies on sensitivity analysis and convergence analysis show the stability and reliable rates of convergence. © 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 974–994, 2017     

A two‐level finite element method for the stationary Navier‐Stokes equations based on a stabilized local projection

In this article, we propose a two‐level finite element method to analyze the approximate solutions of the stationary Navier‐Stokes equations based on a stabilized local projection. The local projection allows to circumvent the Babuska‐Brezzi condition by using equal‐order finite element pairs. The local projection can be used to stabilize high equal‐order finite element pairs. The proposed method combines the local projection stabilization method and the two‐level method under the assumption of the uniqueness condition. The two‐level method consists of solving a nonlinear equation on the coarse mesh and solving a linear equation on fine mesh. The nonlinear equation is solved by the one‐step Newtonian iteration method. In the rest of this article, we show the error analysis of the lowest equal‐order finite element pair and provide convergence rate of approximate solutions. Furthermore, the numerical illustrations coincide with the theoretical analysis expectations. From the view of computational time, the results show that the two‐level method is effective to solve the stationary Navier‐Stokes equations. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

A finite difference scheme for solving parabolic two‐step micro‐heat transport equations in a double‐layered micro‐sphere heated by ultrashort‐pulsed lasers

Ultrashort‐pulsed lasers with pulse durations of the order of sub‐picosecond to femtosecond domain possess exclusive capabilities in limiting the undesirable spread of the thermal process zone in the heated sample. Parabolic two‐step micro heat transport equations have been widely applied for thermal analysis of thin metal films exposed to picosecond thermal pulses. In this study, we develop a three‐level finite difference scheme for solving the micro heat transport equations in a double‐layered micro sphere. It is shown by the discrete energy method that the scheme is unconditionally stable. Numerical results for thermal analysis of a gold layer coated on a chromium padding layer are obtained. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Space‐time spectral method for two‐dimensional semilinear parabolic equations

In this paper, a high‐order accurate numerical method for two‐dimensional semilinear parabolic equations is presented. We apply a Galerkin–Legendre spectral method for discretizing spatial derivatives and a spectral collocation method for the time integration of the resulting nonlinear system of ordinary differential equations. Our formulation can be made arbitrarily high‐order accurate in both space and time. Optimal a priori error bound is derived in the L²‐norm for the semidiscrete formulation. Extensive numerical results are presented to demonstrate the convergence property of the method, show our formulation have spectrally accurate in both space and time. John Wiley & Sons, Ltd.