Numerical solution of Fokker‐Planck equation using the cubic B‐spline scaling functions

In this article a numerical technique is presented for the solution of Fokker‐Planck equation. This method uses the cubic B‐spline scaling functions. The method consists of expanding the required approximate solution as the elements of cubic B‐spline scaling function. Using the operational matrix of derivative, the problem will be reduced to a set of algebraic equations. Some numerical examples are included to demonstrate the validity and applicability of the technique. The method is easy to implement and produces very accurate results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

B‐spline collocation algorithm for numerical solution of the generalized Burger's‐Huxley equation

The cubic B‐spline collocation scheme is implemented to find numerical solution of the generalized Burger's–Huxley equation. The scheme is based on the finite‐difference formulation for time integration and cubic B‐spline functions for space integration. Convergence of the scheme is discussed through standard convergence analysis. The proposed scheme is of second‐order convergent. The accuracy of the proposed method is demonstrated by four test problems. The numerical results are found to be in good agreement with the exact solutions. Results are compared with other results given in literature. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Web‐spline‐based finite element approximation of some quasi‐newtonian flows: Existence‐uniqueness and error bound

This article deals with the web‐spline‐based finite element approximation of quasi‐Newtonian flows. First, we consider the scalar elliptic p‐Laplace problem. Then, we consider quasi‐Newtonian flows where viscosity obeys power law or Carreau law. We prove well‐posedness at the continuous as well as the discrete level. We give some error bounds for the solution of quasi‐Newtonian flow problem based on the web‐spline method. Finally, we provide the numerical results for the p‐Laplace problem. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 54–77, 2015     

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     

Quartic B‐spline collocation algorithms for numerical solution of the RLW equation

The collocation method based on quartic B‐spline interpolation is studied for numerical solution of the regularized long wave (RLW) equation. The time‐split RLW equation is also solved with the quartic B‐spline collocation method. Numerical accuracy is tested by obtaining the single solitary wave solution. Then, interaction, undulation and evolution of solitary waves are studied. Solutions are compared with available results. Conservation quantities are computed for all test experiments. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.     

Numerical analysis nonlinear multi‐term time fractional differential equation with collocation method via fractional B‐spline

In this work, we present numerical analysis for nonlinear multi‐term time fractional differential equation which involve Caputo‐type fractional derivatives for . The proposed method is based on utilization of fractional B‐spline basics in collocation method. The scheme can be readily obtained efficient and quite accurate with less computational work numerical result. The proposal approach transform nonlinear multi‐term time fractional differential equation into a suitable linear system of algebraic equations which can be solved by a suitable numerical method. The numerical experiments will be verify to demonstrate the effectiveness of our method for solving one‐ and two‐dimensional multi‐term time fractional differential equation.     

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.     

Partitioned penalty methods for the transport equation in the evolutionary Stokes–Darcy‐transport problem

There has been a surge of work on models for coupling surface‐water with groundwater flows which is at its core the Stokes–Darcy problem, as well as methods for uncoupling the problem into subdomain, subphysics solves. The resulting (Stokes–Darcy) fluid velocity is important because the flow transports contaminants. The numerical analysis and algorithm development for the evolutionary transport problem has, however, focused on a quasi‐static Stokes–Darcy model and a single domain (fully coupled) formulation of the transport equation. This report presents a numerical analysis of a partitioned method for contaminant transport for the fully evolutionary system. The algorithm studied is unconditionally stable with one subdomain solve per step. Numerical experiments are given using the proposed algorithm that investigates the effects of the penalty parameters on the convergence of the approximations.     

Two‐level Newton iterative method for the 2D/3D steady Navier‐Stokes equations

A combination method of the Newton iteration and two‐level finite element algorithm is applied for solving numerically the steady Navier‐Stokes equations under the strong uniqueness condition. This algorithm is motivated by applying the m Newton iterations for solving the Navier‐Stokes problem on a coarse grid and computing the Stokes problem on a fine grid. Then, the uniform stability and convergence with respect to ν of the two‐level Newton iterative solution are analyzed for the large m and small H and h << H. Finally, some numerical tests are made to demonstrate the effectiveness of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Numerical investigation of the solution of Fisher's equation via the B‐spline Galerkin method

The Galerkin method is used with quadratic B‐spline base functions to obtain the numerical solutions of Fisher's equation which is a one dimensional reaction‐diffusion equation. To observe the effects of reaction and diffusion, four test problems related to pulse disturbance, step disturbance, super‐speed wave and strong reaction are studied. A comparison is performed between the obtained numerical results and some earlier studies. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Four techniques based on the B‐spline expansion and the collocation approach for the numerical solution of the Lane–Emden equation

Four numerical techniques based on the linear B‐spline functions are presented for the numerical solution of the Lane–Emden equation. Some properties of the B‐spline functions are presented and are utilized to reduce the solution of the Lane–Emden equation to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the new techniques. Copyright © 2013 John Wiley & Sons, Ltd.     

A backward euler orthogonal spline collocation method for the time‐fractional Fokker–Planck equation

We formulate and analyze a novel numerical method for solving a time‐fractional Fokker–Planck equation which models an anomalous subdiffusion process. In this method, orthogonal spline collocation is used for the spatial discretization and the time‐stepping is done using a backward Euler method based on the L1 approximation to the Caputo derivative. The stability and convergence of the method are considered, and the theoretical results are supported by numerical examples, which also exhibit superconvergence. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1534–1550, 2015     

The use of cubic B‐spline scaling functions for solving the one‐dimensional hyperbolic equation with a nonlocal conservation condition

Problems for parabolic partial differential equations with nonlocal boundary conditions have been studied in many articles, but boundary value problems for hyperbolic partial differential equations have so far remained nearly uninvestigated. In this article a numerical technique is presented for the solution of a nonclassical problem for the one‐dimensional wave equation. This method uses the cubic B‐spline scaling functions. Some numerical results are reported to support our study. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A decoupling two‐grid algorithm for the mixed Stokes‐Darcy model with the Beavers‐Joseph interface condition

In this article, a decoupling scheme based on two‐grid finite element for the mixed Stokes‐Darcy problem with the Beavers‐Joseph interface condition is proposed and investigated. With a restriction of a physical parameter α, we derive the numerical stability and error estimates for the scheme. Numerical experiments indicate that such two‐grid based decoupling finite element schemes are feasible and efficient. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1066–1082, 2014     

A fourth‐order H1‐Galerkin mixed finite element method for Kuramoto–Sivashinsky equation

A H¹‐Galerkin mixed finite element method is applied to the Kuramoto–Sivashinsky equation by using a splitting technique, which results in a coupled system. The method described in this article may also be considered as a Petrov–Galerkin method with cubic spline space as trial space and piecewise linear space as test space, since the second derivative of a cubic spline is a linear spline. Optimal‐order error estimates are obtained without any restriction on the mesh for both semi‐discrete and fully discrete schemes. The advantage of this method over that presented in Manickam et al., Comput. Math. Appl. vol. 35(6) (1998) pp. 5–25; for the same problem is that the size (i.e., (n + 1) × (n + 1)) of each resulting linear system is less than half of the size of the linear system of the earlier method, where n is the number of subintervals in the partition. Further, there is a requirement of less regularity on exact solution in this method. The results are validated with numerical examples. Finally, instability behavior of the solution is numerically captured with this method.     

Numerical solutions of the coupled Burgers’ equation by the Galerkin quadratic B‐spline finite element method

In this paper, a coupled Burgers’ equation has been numerically solved by a Galerkin quadratic B‐spline FEM. The performance of the method has been examined on three test problems. Results obtained by the method have been compared with known exact solution and other numerical results in the literature. A Fourier stability analysis of the method is also investigated. Copyright © 2013 John Wiley & Sons, Ltd.     

Existence and zero‐electron‐mass limit of strong solutions to the stationary compressible Navier‐Stokes‐Poisson equation with large external force

In this study, we consider a viscous compressible model of plasma and semiconductors, which is expressed as a compressible Navier‐Stokes‐Poisson equation. We prove that there exists a strong solution to the boundary value problem of the steady compressible Navier‐Stokes‐Poisson equation with large external forces in bounded domain, provided that the ratio of the electron/ions mass is appropriately small. Moreover, the zero‐electron‐mass limit of the strong solutions is rigorously verified. The main idea in the proof is to split the original equation into 4 parts, a system of stationary incompressible Navier‐Stokes equations with large forces, a system of stationary compressible Navier‐Stokes equations with small forces, coupled with 2 Poisson equations. Based on the known results about linear incompressible Navier‐Stokes equation, linear compressible Navier‐Stokes, linear transport, and Poisson equations, we try to establish uniform in the ratio of the electron/ions mass a priori estimates. Further, using Schauder fixed point theorem, we can show the existence of a strong solution to the boundary value problem of the steady compressible Navier‐Stokes‐Poisson equation with large external forces. At the same time, from the uniform a priori estimates, we present the zero‐electron‐mass limit of the strong solutions, which converge to the solutions of the corresponding incompressible Navier‐Stokes‐Poisson equations.     

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.     

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.