A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. 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 compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 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.     

On compact approximations of divergence differential equations

A method for the construction of compact difference schemes approximating divergence differential equations is proposed. The schemes have an arbitrarily prescribed order of approximation on general stencils. It is shown that the construction of such schemes for partial differential equations is based on special compact schemes approximating ordinary differential equations in several independent functions. Necessary and sufficient conditions on the coefficients of these schemes with high order of approximation are obtained. Examples of reconstruction of compact difference schemes for partial differential equations with these schemes are given. It is shown that such compact difference schemes have the same order of accuracy both for classical approximations on smooth solutions and weak approximations on discontinuous solutions.     

Symbolic computation of high order compact difference schemes for three dimensional linear elliptic partial differential equations with variable coefficients

We present a symbolic computation procedure for deriving various high order compact difference approximation schemes for certain three dimensional linear elliptic partial differential equations with variable coefficients. Based on the Maple software package, we approximate the leading terms in the truncation error of the Taylor series expansion of the governing equation and obtain a 19 point fourth order compact difference scheme for a general linear elliptic partial differential equation. A test problem is solved numerically to validate the derived fourth order compact difference scheme. This symbolic derivation method is simple and can be easily used to derive high order difference approximation schemes for other similar linear elliptic partial differential equations.     

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     

Gegenbauer spectral method for time‐fractional convection–diffusion equations with variable coefficients

In this paper, we study the numerical solution to time‐fractional partial differential equations with variable coefficients that involve temporal Caputo derivative. A spectral method based on Gegenbauer polynomials is taken for approximating the solution of the given time‐fractional partial differential equation in time and a collocation method in space. The suggested method reduces this type of equation to the solution of a linear algebraic system. Finally, some numerical examples are presented to illustrate the efficiency and accuracy of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.     

On the numerical solution of hyperbolic PDEs with variable space operator

The first and second order of accuracy in time and second order of accuracy in the space variables difference schemes for the numerical solution of the initial‐boundary value problem for the multidimensional hyperbolic equation with dependent coefficients are considered. Stability estimates for the solution of these difference schemes and for the first and second order difference derivatives are obtained. Numerical methods are proposed for solving the one‐dimensional hyperbolic partial differential equation. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2009     

A second‐order finite difference approximation for a mathematical model of erythropoiesis

We present a second‐order finite difference scheme for approximating solutions of a mathematical model of erythropoiesis, which consists of two nonlinear partial differential equations and one nonlinear ordinary differential equation. We show that the scheme achieves second‐order accuracy for smooth solutions. We compare this scheme to a previously developed first‐order method and show that the first order method requires significantly more computational time to provide solutions with similar accuracy. We also compare this numerical scheme with other well‐known second‐order methods and show that it has better capability in approximating discontinuous solutions. Finally, we present an application to recovery after blood loss. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

解偏微分方程的多步-小波-Galerkin方法

推广Lax-Wendroff多步方法,建立一类新的显式和隐式相结合的多步格式,并以此为基础提出了一类显隐多步-小波-Galerkin方法,可以用来求解依赖时间的偏微分方程.不同于Taylor-Galerkin方法,文中的方案在提高时间离散精度时不包含任何新的高阶导数.由于引入了隐式部分,与传统的多步方法相比该方案有更好的稳定性,适合于求解非线性偏微分方程,理论分析和数值例子都说明了方法的有效性.     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A spectral element method using the modal basis and its application in solving second‐order nonlinear partial differential equations

We present a high‐order spectral element method (SEM) using modal (or hierarchical) basis for modeling of some nonlinear second‐order partial differential equations in two‐dimensional spatial space. The discretization is based on the conforming spectral element technique in space and the semi‐implicit or the explicit finite difference formula in time. Unlike the nodal SEM, which is based on the Lagrange polynomials associated with the Gauss–Lobatto–Legendre or Chebyshev quadrature nodes, the Lobatto polynomials are used in this paper as modal basis. Using modal bases due to their orthogonal properties enables us to exactly obtain the elemental matrices provided that the element‐wise mapping has the constant Jacobian. The difficulty of implementation of modal approximations for nonlinear problems is treated in this paper by expanding the nonlinear terms in the weak form of differential equations in terms of the Lobatto polynomials on each element using the fast Fourier transform (FFT). Utilization of the Fourier interpolation on equidistant points in the FFT algorithm and the enough polynomial order of approximation of the nonlinear terms can lead to minimize the aliasing error. Also, this approach leads to finding numerical solution of a nonlinear differential equation through solving a system of linear algebraic equations. Numerical results for some famous nonlinear equations illustrate efficiency, stability and convergence properties of the approximation scheme, which is exponential in space and up to third‐order in time. Copyright © 2014 John Wiley & Sons, Ltd.     

On the stability of alternating‐direction explicit methods for advection‐diffusion equations

Alternating‐Direction Explicit (A.D.E.) finite‐difference methods make use of two approximations that are implemented for computations proceeding in alternating directions, e.g., from left to right and from right to left, with each approximation being explicit in its respective direction of computation. Stable A.D.E. schemes for solving the linear parabolic partial differential equations that model heat diffusion are well‐known, as are stable A.D.E. schemes for solving the first‐order equations of fluid advection. Several of these are combined here to derive A.D.E. schemes for solving time‐dependent advection‐diffusion equations, and their stability characteristics are discussed. In each case, it is found that it is the advection term that limits the stability of the scheme. The most stable of the combinations presented comprises an unconditionally stable approximation for computations carried out in the direction of advection of the system, from left to right in this case, and a conditionally stable approximation for computations proceeding in the opposite direction. To illustrate the application of the methods and verify the stability conditions, they are applied to some quasi‐linear one‐dimensional advection‐diffusion problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

An algorithm for the finite difference approximation of derivatives with arbitrary degree and order of accuracy

In this paper, we introduce an algorithm and a computer code for numerical differentiation of discrete functions. The algorithm presented is suitable for calculating derivatives of any degree with any arbitrary order of accuracy over all the known function sampling points. The algorithm introduced avoids the labour of preliminary differencing and is in fact more convenient than using the tabulated finite difference formulas, in particular when the derivatives are required with high approximation accuracy. Moreover, the given Matlab computer code can be implemented to solve boundary-value ordinary and partial differential equations with high numerical accuracy. The numerical technique is based on the undetermined coefficient method in conjunction with Taylor’s expansion. To avoid the difficulty of solving a system of linear equations, an explicit closed form equation for the weighting coefficients is derived in terms of the elementary symmetric functions. This is done by using an explicit closed formula for the Vandermonde matrix inverse. Moreover, the code is designed to give a unified approximation order throughout the given domain. A numerical differentiation example is used to investigate the validity and feasibility of the algorithm and the code. It is found that the method and the code work properly for any degree of derivative and any order of accuracy.     

On splitting‐based mass and total energy conserving arbitrary order shallow‐water schemes

A new method for numerical solution to the shallow‐water equations is suggested. The method allows constructing a family of finite difference schemes of different approximation order that conserve the mass and the total energy. Our approach is based on the method of splitting, and unlike others it permits to derive conservative numerical schemes after discretizing all the partial derivatives, both spatial and temporal. The schemes thus appear to be fully discrete, both in time and in space. Besides, due to a simple structure of the matrices appeared therewith, the method provides essential benefits in the computational cost of solution and is easy‐to‐implement in the Cartesian and spherical geometries. Numerical results confirm functionality and efficiency of the developed method. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

Radial basis collocation method and quasi‐Newton iteration for nonlinear elliptic problems

This work presents a radial basis collocation method combined with the quasi‐Newton iteration method for solving semilinear elliptic partial differential equations. The main result in this study is that there exists an exponential convergence rate in the radial basis collocation discretization and a superlinear convergence rate in the quasi‐Newton iteration of the nonlinear partial differential equations. In this work, the numerical error associated with the employed quadrature rule is considered. It is shown that the errors in Sobolev norms for linear elliptic partial differential equations using radial basis collocation method are bounded by the truncation error of the RBF. The combined errors due to radial basis approximation, quadrature rules, and quasi‐Newton and Newton iterations are also presented. This result can be extended to finite element or finite difference method combined with any iteration methods discussed in this work. The numerical example demonstrates a good agreement between numerical results and analytical predictions. The numerical results also show that although the convergence rate of order 1.62 of the quasi‐Newton iteration scheme is slightly slower than rate of order 2 in the Newton iteration scheme, the former is more stable and less sensitive to the initial guess. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Galerkin finite element approximation of symmetric space-fractional partial differential equations

In this paper, symmetric space-fractional partial differential equations (SSFPDE) with the Riesz fractional operator are considered. The SSFPDE is obtained from the standard advection-dispersion equation by replacing the first-order and second-order space derivatives with the Riesz fractional derivatives of order 2β ∈ (0, 1) and 2α ∈ (1, 2], respectively. We prove that the variational solution of the SSFPDE exists and is unique. Using the Galerkin finite element method and a backward difference technique, a fully discrete approximating system is obtained, which has a unique solution according to the Lax-Milgram theorem. The stability and convergence of the fully discrete schemes are derived. Finally, some numerical experiments are given to confirm our theoretical analysis.     

Computational methods of solving the boundary value problems for the loaded differential and Fredholm integro‐differential equations

The article presents a new general solution to a loaded differential equation and describes its properties. Solving a linear boundary value problem for loaded differential equation is reduced to the solving a system of linear algebraic equations with respect to the arbitrary vectors of general solution introduced. The system's coefficients and right sides are computed by solving the Cauchy problems for ordinary differential equations. Algorithms of constructing a new general solution and solving a linear boundary value problem for loaded differential equation are offered. Linear boundary value problem for the Fredholm integro‐differential equation is approximated by the linear boundary value problem for loaded differential equation. A mutual relationship between the qualitative properties of original and approximate problems is obtained, and the estimates for differences between their solutions are given. The paper proposes numerical and approximate methods of solving a linear boundary value problem for the Fredholm integro‐differential equation and examines their convergence, stability, and accuracy.     

A numerical study of 2D integrated RBFNs incorporating Cartesian grids for solving 2D elliptic differential problems

This article reports a numerical discretization scheme, based on two‐dimensional integrated radial‐basis‐function networks (2D‐IRBFNs) and rectangular grids, for solving second‐order elliptic partial differential equations defined on 2D nonrectangular domains. Unlike finite‐difference and 1D‐IRBFN Cartesian‐grid techniques, the present discretization method is based on an approximation scheme that allows the field variable and its derivatives to be evaluated anywhere within the domain and on the boundaries, regardless of the shape of the problem domain. We discuss the following two particular strengths, which the proposed Cartesian‐grid‐based procedure possesses, namely (i) the implementation of Neumann boundary conditions on irregular boundaries and (ii) the use of high‐order integration schemes to evaluate flux integrals arising from a control‐volume discretization on irregular domains. A new preconditioning scheme is suggested to improve the 2D‐IRBFN matrix condition number. Good accuracy and high‐order convergence solutions are obtained. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Mobile and immobile gaseous transport: Embedded analytical solutions to finite volume methods

The motivation is driven by deposition processes based on chemical vapor problems. The underlying model problem is based on coupled transport–reaction equations with mobile and immobile areas. We deal with systems of ordinary and partial differential equations. Such equation systems are delicate to solve and we introduce a novel solver method, that takes into account ways to solve analytically parts of the transport and reaction equations. The main idea is to embed the analytical and semianalytical solutions, which can then be explicitly given to standard numerical schemes of higher order. The numerical scheme is based on flux‐based characteristic methods, which is a finite volume method. Such a method is an attractive alternative to the standard numerical schemes, which fully discretize the full equations. We instead reduce the computational time while embedding fast computable analytical parts. Here, we can accelerate the solver process, with a priori explicitly given solutions. We will focus on the derivation of the analytical solutions for general and special solutions of the characteristic methods that are embedded into a finite volume method. In the numerical examples, we illustrate the higher‐order method for different benchmark problems. Finally, the method is verified with realistic results. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012