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.     

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     

A single‐node characteristic collocation method for unsteady‐state convection‐diffusion equations in three‐dimensional spaces

We develop a nonconventional single‐node characteristic collocation method with piecewise‐cubic Hermite polynomials for the numerical simulation to unsteady‐state advection‐diffusion transport partial differential equations. This method greatly reduces the number of unknowns in the conventional collocation method, and generates accurate numerical solutions even if very large time steps are taken. The reduction of number of nodes has great potential for problems defined on high space dimensions, which appears in such problems as quantification of uncertainties in subsurface porous media. The method developed here is easy to formulate. Numerical experiments are presented to show the strong potential of the method. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 786–802, 2011     

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     

A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree

In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)^ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.     

Memory‐efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Novel memory‐efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the standard monomial basis for a larger degree d. The standard way of solving polynomial eigenvalue problems proceeds by linearization, which increases the problem size by a factor d. Consequently, the memory requirements of Krylov subspace methods applied to the linearization grow by this factor. In this paper, we develop two variants of the Arnoldi method that build the Krylov subspace basis implicitly, in a way that only vectors of length equal to the size of the original problem need to be stored. The proposed variants are generalizations of the so‐called quadratic Arnoldi method and two‐level orthogonal Arnoldi procedure methods, which have been developed for the monomial case. We also show how the typical ingredients of a full implementation of the Arnoldi method, including shift‐and‐invert and restarting, can be incorporated. Numerical experiments are presented for matrix polynomials up to degree 30 arising from the interpolation of nonlinear eigenvalue problems, which stem from boundary element discretizations of PDE eigenvalue problems. 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     

Symmetrical weighted essentially non‐oscillatory‐flux limiter schemes for Hamilton–Jacobi equations

In this paper, we propose a new scheme that combines weighted essentially non‐oscillatory (WENO) procedures together with monotone upwind schemes to approximate the viscosity solution of the Hamilton–Jacobi equations. In one‐dimensional (1D) case, first, we obtain an optimum polynomial on a four‐point stencil. This optimum polynomial is third‐order accurate in regions of smoothness. Next, we modify a second‐order ENO polynomial by choosing an additional point inside the stencil in order to obtain the highest accuracy when combined with the Harten–Osher reconstruction‐evolution method limiter. Finally, the optimum polynomial is considered as a symmetric and convex combination of three polynomials with ideal weights. Following the methodology of the classic WENO procedure, then, we calculate the non‐oscillatory weights with the ideal weights. Numerical experiments in 1D and 2D are performed to compare the capability of the hybrid scheme to WENO schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

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     

Quintic spline technique for time fractional fourth‐order partial differential equation

Higher order non‐Fickian diffusion theories involve fourth‐order linear partial differential equations and their solutions. A quintic polynomial spline technique is used for the numerical solutions of fourth‐order partial differential equations with Caputo time fractional derivative on a finite domain. These equations occur in many applications in real life problems such as modeling of plates and thin beams, strain gradient elasticity, and phase separation in binary mixtures, which are basic elements in engineering structures and are of great practical significance to civil, mechanical, and aerospace engineering. The quintic polynomial spline technique is used for space 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 analysis are also discussed. The numerical results are given, which demonstrate the effectiveness and accuracy of the numerical method. The numerical results obtained in this article are also compared favorably well with the results of (S. S. Siddiqi and S. Arshed, Int. J. Comput. Math. 92 (2015), 1496–1518). © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 445–466, 2017     

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.     

Graded Galerkin methods for the high‐order convection‐diffusion problem

We develop a Galerkin method using the Hermite spline on an admissible graded mesh for solving the high‐order singular perturbation problem of the convection‐diffusion type. We identify a special function class to which the solution of the convection‐diffusion problem belongs and characterize the approximation order of the Hermite spline for such a function class. The approximation order is then used to establish the optimal order of uniform convergence for the Galerkin method. Numerical results are presented to confirm the theoretical estimate.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Analysis and computational method based on quadratic B‐spline FEM for the Rosenau–Burgers equation

L_∞‐error estimates for B‐spline Galerkin finite element solution of the Rosenau–Burgers equation are considered. The semidiscrete B‐spline Galerkin scheme is studied using appropriate projections. For fully discrete B‐spline Galerkin scheme, we consider the Crank–Nicolson method and analyze the corresponding error estimates in time. Numerical experiments are given to demonstrate validity and order of accuracy of the proposed method. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 877–895, 2016     

Interpolation Scheme for Planar Cubic <Emphasis Type="Italic">G</Emphasis><Superscript>2</Superscript> Spline Curves

In this paper a method for interpolating planar data points by cubic G ² splines is presented. A spline is composed of polynomial segments that interpolate two data points, tangent directions and curvatures at these points. Necessary and sufficient, purely geometric conditions for the existence of such a polynomial interpolant are derived. The obtained results are extended to the case when the derivative directions and curvatures are not prescribed as data, but are obtained by some local approximation or implied by shape requirements. As a result, the G ² spline is constructed entirely locally.     

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     

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     

Jacobi–Davidson methods for cubic eigenvalue problems

Several Jacobi–Davidson type methods are proposed for computing interior eigenpairs of large‐scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non‐equivalence deflation method with low‐rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the methods to improve stability and efficiency. A semiconductor quantum dot model is given as an example to illustrate the cubic nature of the eigenvalue system resulting from the finite difference approximation. Numerical results of this model are given to demonstrate the convergence and effectiveness of the methods. Comparison results are also provided to indicate advantages and disadvantages among the various methods. Copyright © 2004 John Wiley & Sons, Ltd.     

Cubic spline solution of singularly perturbed boundary value problems with significant first derivatives

We develop a numerical technique for a class of singularly perturbed two-point singular boundary value problems on an uniform mesh using polynomial cubic spline. The scheme derived in this paper is second-order accurate. The resulting linear system of equations has been solved by using a tri-diagonal solver. Numerical results are provided to illustrate the proposed method and to compared with the methods in [R.K. Mohanty, Urvashi Arora, A family of non-uniform mesh tension spline methods for singularly perturbed two-point singular boundary value problems with significant first derivatives, Appl. Math. Comput., 172 (2006) 531–544; M.K. Kadalbajoo, V.K. Aggarwal, Fitted mesh B-spline method for solving a class of singular singularly perturbed boundary value problems, Int. J. Comput. Math. 82 (2005) 67–76].     

A linearization‐based approach of homotopy analysis method for non‐linear time‐fractional parabolic PDEs

In this paper, a novel approach, namely, the linearization‐based approach of homotopy analysis method, to analytically treat non‐linear time‐fractional PDEs is proposed. The presented approach suggests a new optimized structure of the homotopy series solution based on a linear approximation of the non‐linear problem. A comparative study between the proposed approach and standard homotopy analysis approach is illustrated by solving two examples involving non‐linear time‐fractional parabolic PDEs. The performed numerical simulations demonstrate that the linearization‐based approach reduces the computational complexity and improves the performance of the homotopy analysis method.     

An optimal sixth‐order quartic B‐spline collocation method for solving Bratu‐type and Lane‐Emden–type problems

This paper is concerned with the numerical solutions of Bratu‐type and Lane‐Emden–type boundary value problems, which describe various physical phenomena in applied science and technology. We present an optimal collocation method based on quartic B‐spine basis functions to solve such problems. This method is constructed by perturbing the original problem and on a uniform mesh. The method has been tested by four nonlinear examples. In order to show the advantage of the new method, numerical results are compared with those obtained by some of the existing methods, such as normal quartic B‐spline collocation method and the finite difference method (FDM). It has been observed that the order of convergence of the proposed method is six, which is two orders of magnitude larger than the normal quartic B‐spline collocation method. Moreover, our method gives highly accurate results than the FDM.