An upwinding cell‐centered method with piecewise constant velocity over covolumes

We analyze as a covolume method an upwinding cell‐centered method derived from a mixed formulation of the convection–diffusion equation. The covolume method uses primal and dual partitions of the problem domain to assign degrees of freedom and is a natural generalization of the well known MAC (Marker and Cell) method. The concentration is cell‐centered (piecewise constant with respect to the primal partition), and the velocity is covolume‐ or co‐cell centered (piecewise constant with respect to the dual partition). Convergence results are demonstrated in the L² norm. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 49–62, 1999     

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.     

Nonstandard methods for the convective‐dispersive transport equation with nonlinear reactions

A new nonstandard Eulerian‐Lagrangian method is constructed for the one‐dimensional, transient convective‐dispersive transport equation with nonlinear reaction terms. An “exact” difference scheme is applied to the convection‐reaction part of the equation to produce a semi‐discrete approximation with zero local truncation errors with respect to time. The spatial derivatives involved in the remaining dispersion term are then approximated using standard numerical methods. This approach leads to significant, qualitative improvements in the behavior of the numerical solution. It suppresses the numerical instabilities that arise from the incorrect modeling of derivatives and nonlinear reaction terms. Numerical experiments demonstrate the scheme's ability to model convection‐dominated, reactive transport problems. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 617–624, 1999     

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     

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 note on second‐order finite‐difference schemes on uniform meshes for advection‐‐diffusion equations

An artificial‐viscosity finite‐difference scheme is introduced for stabilizing the solutions of advection‐diffusion equations. Although only the linear one‐dimensional case is discussed, the method is easily susceptible to generalization. Some theory and comparisons with other well‐known schemes are carried out. The aim is, however, to explain the construction of the method, rather than considering sophisticated applications. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 581–588, 1999     

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.     

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     

The fully Sinc‐Galerkin method for time‐dependent boundary conditions

The fully Sinc‐Galerkin method is developed for a family of complex‐valued partial differential equations with time‐dependent boundary conditions. The Sinc‐Galerkin discrete system is formulated and represented by a Kronecker product form of those equations. The numerical solution is efficiently calculated and the method exhibits an exponential convergence rate. Several examples, some with a real‐valued solution and some with a complex‐valued solution, are used to demonstrate the performance of this method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

A numerical solution for advection‐diffusion equation using dual reciprocity method

This article describes a numerical method based on the boundary integral equation and dual reciprocity method(DRM) for solving the one‐dimensional advection‐diffusion equations. The concept of DRM is used to convert the domain integral to the boundary that leads to an integration free method. The time derivative is approximated by the time‐stepping method. Numerical results are presented for some problems to demonstrate the usefulness and accuracy of the new approach. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A new numerical approach for single rational soliton solution of Chen‐Lee‐Liu equation with Riesz fractional derivative in optical fibers

In this paper, time‐splitting spectral approximation technique has been proposed for Chen‐Lee‐Liu (CLL) equation involving Riesz fractional derivative. The proposed numerical technique is efficient, unconditionally stable, and of second‐order accuracy in time and of spectral accuracy in space. Moreover, it conserves the total density in the discretized level. In order to examine the results, with the aid of weighted shifted Grünwald‐Letnikov formula for approximating Riesz fractional derivative, Crank‐Nicolson weighted and shifted Grünwald difference (CN‐WSGD) method has been applied for Riesz fractional CLL equation. The comparison of results reveals that the proposed time‐splitting spectral method is very effective and simple for obtaining single soliton numerical solution of Riesz fractional CLL equation.     

A finite element method for the axisymmetric three‐field Stokes system with a discontinuous pressure

A quadrilateral based velocity‐pressure‐extrastress tensor mixed finite element method for solving the three‐field Stokes system in the axisymmetric case is studied. The method derived from Fortin's Q₂ − P₁ velocity‐pressure element is to be used in connection with the standard Galerkin formulation. This makes it particularly suitable for the numerical simulation of viscoelastic flow. It is proven to be second‐order convergent in the natural weighted Sobolev norms, for the system under consideration. The crucial result that the method is uniformly stable is proven for the case of rectangular meshes. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 739–763, 1999     

Convergence acceleration by varying time‐step size using Bi‐CGSTAB method for turbulent flow computation

A design of varying step size approach both in time span and spatial coordinate systems to achieve fast convergence is demonstrated in this study. This method is based on the concept of minimization of residuals by the Bi‐CGSTAB algorithm, so that the convergence can be enforced by varying the time‐step size. The numerical results show that the time‐step size determined by the proposed method improves the convergence rate for turbulent computations using advanced turbulence models in low Reynolds‐number form, and the degree of improvement increases with the degree of the complexity of the turbulence models. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 454–474, 2001.     

A high‐order compact ADI method for solving three‐dimensional unsteady convection‐diffusion problems

We derive a high‐order compact alternating direction implicit (ADI) method for solving three‐dimentional unsteady convection‐diffusion problems. The method is fourth‐order in space and second‐order in time. It permits multiple uses of the one‐dimensional tridiagonal algorithm with a considerable saving in computing time and results in a very efficient solver. It is shown through a discrete Fourier analysis that the method is unconditionally stable in the diffusion case. Numerical experiments are conducted to test its high order and to compare it with the standard second‐order Douglas‐Gunn ADI method and the spatial fourth‐order compact scheme by Karaa. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Combination of standard Galerkin and subspace methods for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

We consider a combination of the standard Galerkin method and the subspace decomposition methods for the numerical solution of the two‐dimensional time‐dependent incompressible Navier‐Stokes equations with nonsmooth initial data. Because of the poor smoothness of the solution near t = 0, we use the standard Galerkin method for time interval [0, 1] and the subspace decomposition method time interval [1, ∞). The subspace decomposition method is based on the solution into the sum of a low frequency component integrated using a small time step Δt and a high frequency integrated using a larger time step pΔt with p > 1. From the H¹‐stability and L²‐error analysis, we show that the subspace decomposition method can yield a significant gain in computing time. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2009     

Analysis of second order and unconditionally stable BDF2‐AB2 method for the Navier‐Stokes equations with nonlinear time relaxation

In this study, we first consider a second order time stepping finite element BDF2‐AB2 method for the Navier‐Stokes equations (NSE). We prove that the method is unconditionally stable and accurate. Second, we consider a nonlinear time relaxation model which consists of adding a term “” to the Navier‐Stokes Equations with the algorithm depends on BDF2‐AB2 method. We prove that this method is unconditionally stable, too. We applied the BDF2‐AB2 method to several numeral experiments including flow around the cylinder. We have also applied BDF2‐AB2 method with nonlinear time relaxation to some problems. It is observed that when the equilibrium errors are high, applying BDF2‐AB2 with nonlinear time relaxation method to the problem yields lower equilibrium errors.     

Finite difference spectral approximation for the time‐space fractional telegraph equation and its parameter estimation

The object of this paper is to present the numerical solution of the time‐space fractional telegraph equation. The proposed method is based on the finite difference scheme in temporal direction and Fourier spectral method in spatial direction. The fast Fourier transform (FFT) technique is applied to practical computation. The stability and convergence analysis are strictly proven, which shows that this method is stable and convergent with (2?α) order accuracy in time and spectral accuracy in space. Moreover, the Levenberg‐Marquardt (L‐M) iterative method is employed for the parameter estimation. Finally, some numerical examples are given to confirm the theoretical analysis.     

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.     

Taylor‐Galerkin B‐spline finite element method for the one‐dimensional advection‐diffusion equation

The advection‐diffusion equation has a long history as a benchmark for numerical methods. Taylor‐Galerkin methods are used together with the type of splines known as B‐splines to construct the approximation functions over the finite elements for the solution of time‐dependent advection‐diffusion problems. If advection dominates over diffusion, the numerical solution is difficult especially if boundary layers are to be resolved. Known test problems have been studied to demonstrate the accuracy of the method. Numerical results show the behavior of the method with emphasis on treatment of boundary conditions. Taylor‐Galerkin methods have been constructed by using both linear and quadratic B‐spline shape functions. Results shown by the method are found to be in good agreement with the exact solution. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Alternative correction equations in the Jacobi‐Davidson method

The correction equation in the Jacobi‐Davidson method is effective in a subspace orthogonal to the current eigenvector approximation, whereas for the continuation of the process only vectors orthogonal to the search subspace are of importance. Such a vector is obtained by orthogonalizing the (approximate) solution of the correction equation against the search subspace. As an alternative, a variant of the correction equation can be formulated that is restricted to the subspace orthogonal to the current search subspace. In this paper, we discuss the effectiveness of this variant. Our investigation is also motivated by the fact that the restricted correction equation can be used for avoiding stagnation in the case of defective eigenvalues. Moreover, this equation plays a key role in the inexact TRQ method [18]. Copyright © 1999 John Wiley & Sons, Ltd.