Superconvergence of Ritz‐Galerkin finite element approximations for second order elliptic problems

In this paper, the author derives an ‐superconvergence for the piecewise linear Ritz‐Galerkin finite element approximations for the second‐order elliptic equation equipped with Dirichlet boundary conditions. This superconvergence error estimate is established between the finite element solution and the usual Lagrange nodal point interpolation of the exact solution, and thus the superconvergence at the nodal points of each element. The result is based on a condition for the finite element partition characterized by the coefficient tensor and the usual shape functions on each element, called ‐equilateral assumption in this paper. Several examples are presented for the coefficient tensor and finite element triangulations which satisfy the conditions necessary for superconvergence. Some numerical experiments are conducted to confirm this new theory of superconvergence.     

Higher order numerical approximation for time dependent singularly perturbed differential‐difference convection‐diffusion equations

In this article, we develop a higher order numerical approximation for time dependent singularly perturbed differential‐difference convection‐diffusion equations. A priori bounds on the exact solution and its derivatives, which are useful for the error analysis of the numerical method are given. We approximate the retarded terms of the model problem using Taylor's series expansion and the resulting time‐dependent singularly perturbed problem is discretized by the implicit Euler scheme on uniform mesh in time direction and a special hybrid finite difference scheme on piecewise uniform Shishkin mesh in spatial direction. We first prove that the proposed numerical discretization is uniformly convergent of , where and denote the time step and number of mesh‐intervals in space, respectively. After that we design a Richardson extrapolation scheme to increase the order of convergence in time direction and then the new scheme is proved to be uniformly convergent of . Some numerical tests are performed to illustrate the high‐order accuracy and parameter uniform convergence obtained with the proposed numerical methods.     

Long‐time stability and asymptotic analysis of the IFE method for the multilayer porous wall model

In this article, we study the long‐time stability and asymptotic behavior of the immersed finite element (IFE) method for the multilayer porous wall model for the drug‐eluting stents. First, with the IFE method for the spatial descretization, and the implicit Euler scheme for the temporal discretization, respectively, we deduce the global stability of fully discrete solution. Then, we investigate the asymptotic behavior of the discrete scheme which reveals that the multilayer porous wall model converges to the corresponding elliptic equation if approaches to a steady‐state in both and norms as . Finally, some numerical experiments are given to verify the theoretical predictions.     

Numerical solutions to a BBM‐Burgers model with a nonlocal viscous term

In this paper, we numerically investigate the BBM‐Burgers equation with a nonlocal viscous term (1) where is the Riemann‐Liouville half derivative. In particular, we implement different numerical schemes to approximate the solution and its asymptotical behavior. Also, we compare our numerical results with those given in 2013, 2014 for similar models.     

High‐order implicit staggered‐grid finite differences methods for the acoustic wave equation

Motivated by the idea that staggered‐grid methods give a greater stability and give energy conservation, this article presents a new family of high‐order implicit staggered‐grid finite difference methods with any order of accuracy to approximate partial differential equations involving second‐order derivatives. In particular, we numerically analyze our new methods for the solution of the one‐dimensional acoustic wave equation. The implicit formulation is based on the plane wave theory and the Taylor series expansion and only involves the solution of tridiagonal matrix equations resulting in an attractive method with higher order of accuracy but nearly the same computation cost as those of explicit formulation. The order of accuracy of the proposal staggered formulas are similar to the methods with conventional grids for a ‐point operator: the explicit formula is th‐order and the implicit formula is th‐order; however, the results demonstrate that new staggered methods are superior in terms of stability properties to the classical methods in the context of solving wave equations.     

Optimal error estimate of a conformal Fourier pseudo‐spectral method for the damped nonlinear Schrödinger equation

In this article, a Fourier pseudospectral method, which preserves the conforal conservation la, is proposed for solving the damped nonlinear Schrödinger equation. Based on the energy method and the semi‐norm equivalence between the Fourier pseudospectral method and the finite difference method, a priori estimate for the new method is established, which shows that the proposed method is unconditionally convergent with order of in the discrete ‐norm, where is the time step and is the number of collocation points used in the spectral method. Some numerical results are addressed to confirm our theoretical analysis.     

Fast solution algorithms for exponentially tempered fractional diffusion equations

In this article, a fast‐iterative method and a fast‐direct method is proposed for solving one‐dimensional and two‐dimensional tempered fractional diffusion equations with constant coefficients. The proposed iterative method is accelerated by circulant preconditioning which is shown to converge superlinearly while the proposed direct method is based on circulant and skew‐circulant representation for Toeplitz matrix inversion. In one‐dimensional case, the operation cost of the proposed methods are both shown to be with memory requirement in each time step, where is the number of spatial nodes. With the alternating direction implicit method, it is proven that the proposed fast solution algorithms can be extended to handle two‐dimensional tempered fractional diffusion equations with operation cost and memory requirement in each time step, where the number of spatial nodes in ‐direction and ‐direction both equal to . Numerical examples are provided to illustrate the effectiveness and efficiency of the proposed methods.     

Two‐grid method for two‐dimensional nonlinear Schrödinger equation by finite element method

A conservative two‐grid finite element scheme is presented for the two‐dimensional nonlinear Schrödinger equation. One Newton iteration is applied on the fine grid to linearize the fully discrete problem using the coarse‐grid solution as the initial guess. Moreover, error estimates are conducted for the two‐grid method. It is shown that the coarse space can be extremely coarse, with no loss in the order of accuracy, and still achieve the asymptotically optimal approximation as long as the mesh sizes satisfy in the two‐grid method. The numerical results show that this method is very effective.     

Asymptotic Analysis and Optimal Error estimates for Benjamin‐Bona‐Mahony‐Burgers' Type Equations

In this article, stabilization result for the Benjamin‐Bona‐Mahony‐Burgers' (BBM‐B) equation, that is, convergence of unsteady solution to steady state solution is established under the assumption that a linearized steady state eigenvalue problem has a minimal positive eigenvalue. Based on appropriate conditions on the forcing function, exponential decay estimates in , and ‐norms are derived, which are valid uniformly with respect to the coefficient of dispersion as it tends to zero. It is, further, observed that the decay rate for the BBM‐B equation is smaller than that of the decay rate for the Burgers equation. Then, a semidiscrete Galerkin method for spatial direction keeping time variable continuous is considered and stabilization results are discussed for the semidiscrete problem. Moreover, optimal error estimates in ‐norms preserving exponential decay property are established using the steady state error estimates. For a complete discrete scheme, a backward Euler method is applied for the time discretization and stabilization results are again proved for the fully discrete problem. Subsequently, numerical experiments are conducted, which verify our theoretical results. The article is finally concluded with a brief discussion on an extension to a multidimensional nonlinear Sobolev equation with Burgers' type nonlinearity.     

Unconditional superconvergence analysis of an H1‐galerkin mixed finite element method for nonlinear Sobolev equations

An efficient H¹‐Galerkin mixed finite element method (MFEM) is presented with and zero order Raviart‐Thomas elements for the nonlinear Sobolev equations. On one hand, the existence and uniqueness of the solutions of the semidiscrete approximation scheme are proved and the super close results of order for the original variable u in a broken H¹ norm and the auxiliary variable in norm are deduced without the boundedness of the numerical solution in ‐norm. Conversely, a linearized Crank‐Nicolson fully discrete scheme with the unconditional super close property is also developed through a new approach, while previous literature always require certain time step conditions (see the references below). Finally, a numerical experiment is included to illustrate the feasibility of the proposed method. Here h is the subdivision parameter and τ is the time step.     

On a nonoverlapping additive Schwarz method for h‐p discontinuous Galerkin discretization of elliptic problems

The condition number of a discontinuous Galerkin finite element discretization preconditioned with a nonoverlapping additive Schwarz method is analyzed. We improve the result of Antonietti and Houston (J Sci Comput 46 (2011), 124–149), where a bound has been proved for a two‐level nonoverlapping additive Schwarz method with coarse problem using polynomials of degree on a coarse mesh size . In a more general framework, where the concurrency of the algorithm is increased by applying solvers on subdomains smaller than the coarse grid cells, we prove that the condition number of the preconditioned system is where is the coarse space element degree polynomial and is the size of subdomain where local problems are solved in parallel. Our result also extends to the case of discontinuous coefficient, piecewise constant on the coarse grid, for a composite continuous–discontinuous Galerkin discretization. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1572–1590, 2016     

Numerical simulation and solutions of the two‐component second order KdV evolutionarysystem

In this study, with the aid of Wolfram Mathematica 11, the modified exp ‐expansion function method is used in constructing some new analytical solutions with novel structure such as the trigonometric and hyperbolic function solutions to the well‐known nonlinear evolutionary equation, namely; the two‐component second order KdV evolutionary system. Second, the finite forward difference method is used in analyzing the numerical behavior of this equation. We consider equation (6.5) and (6.6) for the numerical analysis. We examine the stability of the two‐component second order KdV evolutionary system with the finite forward difference method by using the Fourier‐Von Neumann analysis. We check the accuracy of the finite forward difference method with the help of and norm error. We present the comparison between the exact and numerical solutions of the two‐component second order KdV evolutionary system obtained in this article which and support with graphics plot. We observed that the modified exp ‐expansion function method is a powerful approach for finding abundant solutions to various nonlinear models and also finite forward difference method is efficient for examining numerical behavior of different nonlinear models.     

A block‐centered finite difference method for fractional Cattaneo equation

In this article, a block‐centered finite difference method for fractional Cattaneo equation is introduced and analyzed. The unconditional stability and the global convergence of the scheme are proved rigorously. Some a priori estimates of discrete norm with optimal order of convergence both for pressure and velocity are established on nonuniform rectangular grids. Moreover, the applicability and accuracy of the scheme are demonstrated by numerical experiments to support our theoretical analysis.     

A fourth‐order Hermitian box‐scheme with fast solver for the Poisson problem in a cube

We present a fourth‐order Hermitian box‐scheme (HB‐scheme) for the Poisson problem in a cube. A single‐nonstaggered regular grid is used supporting the discrete unknowns u and . The scheme is fourth‐order accurate for u and in norm. The fast numerical resolution uses a matrix capacitance method, resulting in a computational complexity of . Numerical results are reported on several examples including nonseparable problems. The present scheme is the extension to the three‐dimensional case of the HB‐scheme presented in Abbas and Croisille [J Sci Comp 49 (2011), 239–267]. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 609–629, 2015     

An implicit scheme for singularly perturbed parabolic problem with retarded terms arising in computational neuroscience

A class of time‐dependent singularly perturbed convection‐diffusion problems with retarded terms arising in computational neuroscience is considered. In particular, a numerical scheme for the parabolic convection‐diffusion problem where the second‐order derivative with respect to the spatial direction is multiplied by a small perturbation parameter and the shifts are of is constructed. The Taylor series expansion is used to tackle the shift terms. The continuous problem is semidiscretized using the Crank‐Nicolson finite difference method in the temporal direction and the resulting set of ordinary differential equations is discretized using a midpoint upwind finite difference scheme on an appropriate piecewise uniform mesh, which is dense in the boundary layer region. It is shown that the proposed numerical scheme is second‐order accurate in time and almost first‐order accurate in space with respect to the perturbation parameter . To validate the computational results and efficiency of the method some numerical examples are encountered and the numerical results are compared with some existing results. It is observed that the numerical approximations are fairly good irrespective of the size of the delay and the advance till they are of . The effect of the shifts on the boundary layer has also been observed.     

A fast discontinuous finite element discretization for the space‐time fractional diffusion‐wave equation

In this article, we study fast discontinuous Galerkin finite element methods to solve a space‐time fractional diffusion‐wave equation. We introduce a piecewise‐constant discontinuous finite element method for solving this problem and derive optimal error estimates. Importantly, a fast solution technique to accelerate Toeplitz matrix‐vector multiplications which arise from discontinuous Galerkin finite element discretization is developed. This fast solution technique is based on fast Fourier transform and it depends on the special structure of coefficient matrices. In each temporal step, it helps to reduce the computational work from required by the traditional methods to log , where is the size of the coefficient matrices (number of spatial grid points). Moreover, the applicability and accuracy of the method are verified by numerical experiments including both continuous and discontinuous examples to support our theoretical analysis.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2043–2061, 2017     

A fast‐high order compact difference method for the fractional cable equation

The Cable equation is one of the most fundamental equations for modeling neuronal dynamics. In this article, we consider a high order compact finite difference numerical solution for the fractional Cable equation, which is a generalization of the classical Cable equation by taking into account the anomalous diffusion in the movement of the ions in neuronal system. The resulting finite difference scheme is unconditionally stable and converges with the convergence order of in maximum norm, 1‐norm and 2‐norm. Furthermore, we present a fast solution technique to accelerate Toeplitz matrix‐vector multiplications arising from finite difference discretization. This fast solution technique is based on a fast Fourier transform and depends on the special structure of coefficient matrices, and it helps to reduce the computational work from required by traditional methods to without using any lossy compression, where and τ is the size of time step, and h is the size of space step. Moreover, we give a compact finite difference scheme and consider its stability analysis for two‐dimensional fractional Cable equation. The applicability and accuracy of the scheme are demonstrated by numerical experiments to support our theoretical analysis.     

Two unconditionally stable and convergent difference schemes with the extrapolation method for the one‐dimensional distributed‐order differential equations

The Grünwald formula is used to solve the one‐dimensional distributed‐order differential equations. Two difference schemes are derived. It is proved that the schemes are unconditionally stable and convergent with the convergence orders and in maximum norm, respectively, where and are step sizes in time, space and distributed order. The extrapolation method is applied to improve the approximate accuracy to the orders and respectively. An illustrative numerical example is given to confirm the theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 591–615, 2016     

The fictitious domain method with L2‐penalty for the Stokes problem with the Dirichlet boundary condition

We consider the fictitious domain method with L²‐penalty for the Stokes problem with the Dirichlet boundary condition. First, we investigate the error estimates for the penalty method at the continuous level. We obtain the convergence of order in H¹‐norm for the velocity and in L²‐norm for the pressure, where is the penalty parameter. The L²‐norm error estimate for the velocity is upgraded to . Moreover, we derive the a priori estimates depending on for the solution of the penalty problem. Next, we apply the finite element approximation to the penalty problem using the P1/P1 element with stabilization. For the discrete penalty problem, we prove the error estimate in H¹‐norm for the velocity and in L²‐norm for the pressure, where h denotes the discretization parameter. For the velocity in L²‐norm, the convergence rate is improved to . The theoretical results are verified by the numerical experiments.     

Local error estimates of the finite element method for an elliptic problem with a Dirac source term

The solutions of elliptic problems with a Dirac measure right‐hand side are not in dimension and therefore the convergence of the finite element solutions is suboptimal in the ‐norm. In this article, we address the numerical analysis of the finite element method for the Laplace equation with Dirac source term: we consider, in dimension 3, the Dirac measure along a curve and, in dimension 2, the punctual Dirac measure. The study of this problem is motivated by the use of the Dirac measure as a reduced model in physical problems, for which high accuracy of the finite element method at the singularity is not required. We show a quasioptimal convergence in the ‐norm, for on subdomains which exclude the singularity; in the particular case of Lagrange finite elements, an optimal convergence in ‐norm is shown on a family of quasiuniform meshes. Our results are obtained using local Nitsche and Schatz‐type error estimates, a weak version of Aubin‐Nitsche duality lemma and a discrete inf‐sup condition. These theoretical results are confirmed by numerical illustrations.