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.     

Fourth‐order compact scheme for the one‐dimensional sine‐Gordon equation

Finite difference scheme to the generalized one‐dimensional sine‐Gordon equation is considered in this paper. After approximating the second order derivative in the space variable by the compact finite difference, we transform the sine‐Gordon equation into an initial‐value problem of a second‐order ordinary differential equation. Then Padé approximant is used to approximate the time derivatives. The resulting fully discrete nonlinear finite‐difference equation is solved by a predictor‐corrector scheme. Both Dirichlet and Neumann boundary conditions are considered in our proposed algorithm. Stability analysis and error estimate are given for homogeneous Dirichlet boundary value problems using energy method. Numerical results are given to verify the condition for stability and convergence and to examine the accuracy and efficiency of the proposed algorithm. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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     

A pseudo‐spectral method that uses an overlapping multidomain technique for the numerical solution of sine‐Gordon equation in one and two spatial dimensions

In this article, we study an explicit scheme for the solution of sine‐Gordon equation when the space discretization is carried out by an overlapping multidomain pseudo‐spectral technique. By using differentiation matrices, the equation is reduced to a nonlinear system of ordinary differential equations in time that can be discretized with the explicit fourth‐order Runge–Kutta method. To achieve approximation with high accuracy in large domains, the number of space grid points must be large enough. This yields very large and full matrices in the pseudo‐spectral method that causes large memory requirements. The domain decomposition approach provides sparsity in the matrices obtained after the discretization, and this property reduces storage for large matrices and provides economical ways of performing matrix–vector multiplications. Therefore, we propose a multidomain pseudo‐spectral method for the numerical simulation of the sine‐Gordon equation in large domains. Test examples are given to demonstrate the accuracy and capability of the proposed method. Numerical experiments show that the multidomain scheme has an excellent long‐time numerical behavior for the sine‐Gordon equation in one and two dimensions. Copyright © 2013 John Wiley & Sons, Ltd.     

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     

A fast and efficient two-grid method for solving d-dimensional poisson equations

The aim of this paper is to introduce a fast and efficient new two-grid method to solve the d-dimensional (d=1,2,3) Poisson elliptic 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 finite difference equations are based on applying a finite difference scheme of two- and four-orders (compact finite difference method) for discretizing the spatial derivative. The obtained linear systems of Poisson elliptic equations have been solved by a new two-grid (NTG) method and we also note that the NTG method which is used for solving the large sparse linear systems is faster and more effective than that of the standard two-grid method. We utilize the local Fourier analysis to show that the spectral radius of the new two-grid method for 1D and 2D models is less than that of the standard two-grid method. As well as, we expand the corresponding algorithm to the new multi-grid method. The numerical examples show the efficiency of the new algorithms for solving the d-dimensional Poisson equations.     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

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     

The boundary integral equation approach for numerical solution of the one‐dimensional Sine‐Gordon equation

This article describes a numerical method based on the boundary integral equation and dual reciprocity method for solving the one‐dimensional Sine‐Gordon (SG) equation. The time derivative is approximated by the time‐stepping method and a predictor–corrector scheme is employed to deal with the nonlinearity which appears in the problem. Numerical results are presented for some problems to demonstrate the usefulness and accuracy of this approach. In addition, the conservation of energy in SG equation is investigated. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

BEM‐FEM coupling for the 1D Klein–Gordon equation

A transmission (bidomain) problem for the one‐dimensional Klein–Gordon equation on an unbounded interval is numerically solved by a boundary element method‐finite element method (BEM‐FEM) coupling procedure. We prove stability and convergence of the proposed method by means of energy arguments. Several numerical results are presented, confirming theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 2042–2082, 2014     

The combination of collocation,finite difference,and multigrid methods for solution of the two‐dimensional wave equation

In this article, we apply compact finite difference approximations of orders two and four for discretizing spatial derivatives of wave equation and collocation method for the time component. The resulting method is unconditionally stable and solves the wave equation with high accuracy. The solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. We employ the multigrid method for solving the resulted linear system. Multigrid method is an iterative method which has grid independently convergence and solves the linear system of equations in small amount of computer time. Numerical results show that the compact finite difference approximation of fourth order, collocation and multigrid methods produce a very efficient method for solving the wave equation. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Space‐time spectral collocation method for the one‐dimensional sine‐Gordon equation

In this article, we introduce a new space‐time spectral collocation method for solving the one‐dimensional sine‐Gordon equation. We apply a spectral collocation method for discretizing spatial derivatives, and then use the spectral collocation method for the time integration of the resulting nonlinear second‐order system of ordinary differential equations (ODE). Our formulation has high‐order accurate in both space and time. Optimal a priori error bounds are derived in the L²‐norm for the semidiscrete formulation. Numerical experiments show that our formulation have exponential rates of convergence in both space and time. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 670–690, 2015     

Klein‐Gordon‐Zakharov system in energy space: Blow‐up profile and subsonic limit

In this paper, we prove finite‐time blowup in energy space for the three‐dimensional Klein‐Gordon‐Zakharov (KGZ) system by modified concavity method. We obtain the blow‐up rates of solutions in local and global space, respectively. In addition, by using the energy convergence, we study the subsonic limit of the Cauchy problem for KGZ system and prove that any finite energy solution converges to the corresponding solution of Klein‐Gordon equation in energy space.     

Integrated fast and high‐accuracy computation of convection diffusion equations using multiscale multigrid method

We present an explicit sixth‐order compact finite difference scheme for fast high‐accuracy numerical solutions of the two‐dimensional convection diffusion equation with variable coefficients. The sixth‐order scheme is based on the well‐known fourth‐order compact (FOC) scheme, the Richardson extrapolation technique, and an operator interpolation scheme. For a particular implementation, we use multiscale multigrid method to compute the fourth‐order solutions on both the coarse grid and the fine grid. Then, an operator interpolation scheme combined with the Richardson extrapolation technique is used to compute a sixth‐order accurate fine grid solution. We compare the computed accuracy and the implementation cost of the new scheme with the standard nine‐point FOC scheme and Sun–Zhang's sixth‐order method. Two convection diffusion problems are solved numerically to validate our proposed sixth‐order scheme. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

An accurate numerical method for solving the linear fractional Klein–Gordon equation

In this article, an implementation of an efficient numerical method for solving the linear fractional Klein–Gordon equation (LFKGE) is introduced. The fractional derivative is described in the Caputo sense. The method is based upon a combination between the properties of the Chebyshev approximations and finite difference method (FDM). The proposed method reduces LFKGE to a system of ODEs, which is solved using FDM. Special attention is given to study the convergence analysis and deduce an error upper bound of the proposed method. Numerical example is given to show the validity and the accuracy of the proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

High order implicit collocation method for the solution of two‐dimensional linear hyperbolic equation

In this article, we introduce a high‐order accurate method for solving the two dimensional linear hyperbolic equation. We apply a compact finite difference approximation of fourth order for discretizing spatial derivatives of linear hyperbolic equation and collocation method for the time component. The resulted method is unconditionally stable and solves the two‐dimensional linear hyperbolic equation with high accuracy. 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 give a very efficient approach for solving the two dimensional linear hyperbolic equation. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A numerical method for the one‐dimensional sine‐Gordon equation

A numerical method based on a predictor–corrector (P‐C) scheme arising from the use of rational approximants of order 3 to the matrix‐exponential term in a three‐time level recurrence relation is applied successfully to the one‐dimensional sine‐Gordon equation, already known from the bibliography. In this P‐C scheme a modification in the corrector (MPC) has been proposed according to which the already evaluated corrected values are considered. The method, which uses as predictor an explicit finite‐difference scheme arising from the second order rational approximant and as corrector an implicit one, has been tested numerically on the single and the soliton doublets. Both the predictor and the corrector schemes are analyzed for local truncation error and stability. From the investigation of the numerical results and the comparison of them with other ones known from the bibliography it has been derived that the proposed P‐C/MPC schemes at least coincide in terms of accuracy with them. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

A predictor‐‐corrector scheme for the sine‐Gordon equation

A predictor–corrector scheme is developed for the numerical solution of the sine‐Gordon equation using the method of lines approach. The solution of the approximating differential system satisfies a recurrence relation, which involves the cosine function. Pade' approximants are used to replace the cosine function in the recurrence relation. The resulting schemes are analyzed for order, stability, and convergence. Numerical results demonstrate the efficiency and accuracy of the predictor–corrector scheme over some well‐known existing methods. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 133–146, 2000     

A novel attempt for finding comparatively accurate solution for sine‐Gordon equation comprising Riesz space fractional derivative

In this paper, a numerical procedure involving Chebyshev wavelet method has been implemented for computing the approximate solution of Riesz space fractional sine‐Gordon equation (SGE). Two‐dimensional Chebyshev wavelet method is implemented to calculate the numerical solution of space fractional SGE. The fractional SGE is considered as an interpolation between the classical SGE (corresponding to α = 2) and nonlocal SGE (corresponding to α = 1). As a consequence, the approximate solutions of fractional SGE obtained by using Chebyshev wavelet approach were compared with those derived by using modified homotopy analysis method with Fourier transform. Copyright © 2015 John Wiley & Sons, Ltd.     

Numerical results for the Klein‐Gordon equation in de Sitter spacetime

We consider the initial value problem for the Klein‐Gordon equation in de Sitter spacetime. We use the central difference scheme on the temporal discretization. We also discretize the spatial variable using the finite element method with implicit and the Crank‐Nicolson schemes for the numerical solution of the initial value problem. In order to show the accuracy for the results of the solutions, we also examine the finite difference methods. We observe that the numerical results obtained by using these methods are compatible.