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.     

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.     

Superconvergence and stability for boundary penalty techniques of finite difference methods

The finite difference method (FDM) is used for Dirichlet problems of Poisson's equation, and the Dirichlet boundary condition is dealt with by boundary penalty techniques. Two penalty techniques, penalty‐integrals and penalty‐collocations (i.e., fixing), are proposed in this paper. The error bounds in the discrete H¹ norm and the infinite norms are derived. The stability analysis is based on the new effective condition number (Cond_eff) but not on the traditional condition number (Cond). The bounds of Cond_eff are explored to display that both the penalty‐integral and the penalty‐collocation techniques have good stability; the huge Cond is misleading. Since the penalty‐collocation technique (i.e., the fixing technique) is simpler, it has been applied in engineering problem for a long time. It is worthy to point out that this paper is the first time to provide a theoretical justification for such a popular penalty‐collocation (fixing) technique. Hence the penalty‐collocation is recommended for dealing with the complicated constraint conditions such as the clamped and the simply support boundary conditions of biharmonic equations. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

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     

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     

Finite‐difference schemes for transport‐dominated equations using special collocation nodes

We introduce finite‐difference schemes based on a special upwind‐type collocation grid, in order to obtain approximations of the solution of linear transport‐dominated advection‐diffusion problems. The method is well suited when the diffusion parameter is very small compared to the discretization parameter. A theory is developed and many numerical experiments are shown. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Least‐square collocation and Lagrange multipliers forTaylor meshless method

A recently proposed meshless method is discussed in this article. It relies on Taylor series, the shape functions being high degree polynomials deduced from the Partial Differential Equation (PDE). In this framework, an efficient technique to couple several polynomial approximations has been presented in (Tampango, Potier‐Ferry, Koutsawa, Tiem, Int. J. Numer. Meth. Eng. vol. 95 (2013) pp. 1094–1112): the boundary conditions were applied using the least‐square collocation and the interface was coupled by a bridging technique based on Lagrange multipliers. In this article, least‐square collocation and Lagrange multipliers are applied for boundary conditions, respectively, and least‐square collocation is revisited to account for the interface conditions in piecewise resolutions. Various combinations of these two techniques have been investigated and the numerical results prove their effectiveness to obtain very accurate solutions, even for large scale problems.     

Boundary‐conforming coordinates with grid line control for acoustic scattering from complexly shaped obstacles

The current work sets forth a practical approach to numerically solve two‐dimensional direct acoustic scattering problems from complexly shaped scatterers with severe singularities, such as corners and cusps. First, boundary conforming coordinates are generated. This generation is performed through an elliptic grid generator algorithm, including control of the coordinate lines. The grid line control solely depends on the initial distribution of grid points. Following the grid generation process, the initial boundary value problem, modelling the scattering phenomenon, is formulated in terms of the new curvilinear coordinates, and a finite‐difference time domain method is implemented. The presence of the boundary singularities causes instability of the numerical method. However, by appropriately controlling the distance between grid lines in the vicinity of these singularities, stability and convergence are achieved. A semianalytical formula for the differential scattering cross‐section is obtained from the discrete Fourier transform of the computed scattered pressure field. The method is successfully applied to several interesting scatterers of various shapes. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain

A new shift‐adaptive meshfree method for solving a class of time‐dependent partial differential equations (PDEs) in a bounded domain (one‐dimensional domain) with moving boundaries and nonhomogeneous boundary conditions is introduced. The radial basis function (RBF) collocation method is combined with the finite difference scheme, because, unlike with Kansa's method, nonlinear PDEs can be converted to a system of linear equations. The grid‐free property of the RBF method is exploited, and a new adaptive algorithm is used to choose the location of the collocation points in the first time step only. In fact, instead of applying the adaptive algorithm on the entire domain of the problem (like with other existing adaptive algorithms), the new adaptive algorithm can be applied only on time steps. Furthermore, because of the radial property of the RBFs, the new adaptive strategy is applied only on the first time step; in the other time steps, the adaptive nodes (obtained in the first time step) are shifted. Thus, only one small system of linear equations must be solved (by LU decomposition method) rather than a large linear or nonlinear system of equations as in Kansa's method (adaptive strategy applied to entire domain), or a large number of small linear systems of equations in the adaptive strategy on each time step. This saves a lot in time and memory usage. Also, Stability analysis is obtained for our scheme, using Von Neumann stability analysis method. Results show that the new method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution, and the adaptive grading scheme is effective in localizing oscillations due to sharp gradients or discontinuities in the solution. The efficiency and effectiveness of the proposed procedure is examined by adaptively solving two difficult benchmark problems, including a regularized long‐wave equation and a Korteweg‐de Vries problem. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1622–1646, 2016     

An efficient pseudo‐spectral Legendre–Galerkin method for solving a nonlinear partial integro‐differential equation arising in population dynamics

The pseudo‐spectral Legendre–Galerkin method (PS‐LGM) is applied to solve a nonlinear partial integro‐differential equation arising in population dynamics. This equation is a competition model in which similar individuals are competing for the same resources. It is a kind of reaction–diffusion equation with integral term corresponding to nonlocal consumption of resources. The proposed method is based on the Legendre–Galerkin formulation for the linear terms and interpolation operator at the Chebyshev–Gauss–Lobatto (CGL) points for the nonlinear terms. Also, the integral term, which is a kind of convolution, is directly computed by a fast and accurate method based on CGL interpolation operator, and thus, the use of any quadrature formula in its computation is avoided. The main difference of the PS‐LGM presented in the current paper with the classic LGM is in treating the nonlinear terms and imposing boundary conditions. Indeed, in the PS‐LGM, the nonlinear terms are efficiently handled using the CGL points, and also the boundary conditions are imposed strongly as collocation methods. Combination of the PS‐LGM with a semi‐implicit time integration method such as second‐order backward differentiation formula and Adams‐Bashforth method leads to reducing the complexity of computations and obtaining a linear algebraic system of equations with banded coefficient matrix. The desired equation is considered on one and two‐dimensional spatial domains. Efficiency, accuracy, and convergence of the proposed method are demonstrated numerically in both cases. Copyright © 2012 John Wiley & Sons, Ltd.     

An explicit spectral collocation method using nonpolynomial basis functions for the time‐dependent Schrödinger equation

We propose a spectral collocation method for the numerical solution of the time‐dependent Schrödinger equation, where the newly developed nonpolynomial functions in a previous study are used as basis functions. Equipped with the new basis functions, various boundary conditions can be imposed exactly. The preferable semi‐implicit time marching schemes are employed for temporal discretization. Moreover, the new basis functions build in a free parameter λ intrinsically, which can be chosen properly so that the semi‐implicit scheme collapses to an explicit scheme. The method is further applied to linear Schrödinger equation set in unbounded domain. The transparent boundary conditions are constructed for time semidiscrete scheme of the linear Schrödinger equation. We employ spectral collocation method using the new basis functions for the spatial discretization, which allows for the exact imposition of the transparent boundary conditions. Comprehensive numerical tests both in bounded and unbounded domain are performed to demonstrate the attractive features of the proposed method.     

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     

Single‐cell compact finite‐difference discretization of order two and four for multidimensional triharmonic problems

In this article, we discuss finite‐difference methods of order two and four for the solution of two‐and three‐dimensional triharmonic equations, where the values of u,(?²u/?n²) and (?⁴u/?n⁴) are prescribed on the boundary. For 2D case, we use 9‐ and for 3D case, we use 19‐ uniform grid points and a single computational cell. We introduce new ideas to handle the boundary conditions and do not require to discretize the boundary conditions at the boundary. The Laplacian and the biharmonic of the solution are obtained as byproduct of the methods. The resulting matrix system is solved by using the appropriate block iterative methods. Computational results are provided to demonstrate the fourth‐order accuracy of the proposed methods. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

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     

Operator time‐splitting techniques combined with quintic B‐spline collocation method for the generalized Rosenau–KdV equation

In this article, the generalized Rosenau–KdV equation is split into two subequations such that one is linear and the other is nonlinear. The resulting subequations with the prescribed initial and boundary conditions are numerically solved by the first order Lie–Trotter and the second‐order Strang time‐splitting techniques combined with the quintic B‐spline collocation by the help of the fourth order Runge–Kutta (RK‐4) method. To show the accuracy and reliability of the proposed techniques, two test problems having exact solutions are considered. The computed error norms L₂ and L_∞ with the conservative properties of the discrete mass Q(t) and energy E(t) are compared with those available in the literature. The convergence orders of both techniques have also been calculated. Moreover, the stability analyses of the numerical schemes are investigated.     

Moving collocation method for a reaction‐diffusion equation with a traveling heat source

We consider a reaction‐diffusion equation with a traveling heat source on an unbounded domain. The numerical simulation of the problem is difficult because of the moving singularity, the blow‐up phenomenon, and the delta function in the equation. Because we are only interested in the solution behavior near the heat source, we choose a bounded moving domain which contains the heat source and has the same speed as the source. Local absorbing boundary conditions are constructed on the boundaries of the moving domain. Then, we transform the moving domain to a fixed one. At last, a special moving collocation method is adopted. The new method is much simpler than the existing moving finite difference methods. Moreover, numerical experiments illustrate the accuracy and efficiency of our moving collocation method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

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     

On order‐reducible sinc discretizations and block‐diagonal preconditioning methods for linear third‐order ordinary differential equations

By introducing a variable substitution, we transform the two‐point boundary value problem of a third‐order ordinary differential equation into a system of two second‐order ordinary differential equations (ODEs). We discretize this order‐reduced system of ODEs by both sinc‐collocation and sinc‐Galerkin methods, and average these two discretized linear systems to obtain the target system of linear equations. We prove that the discrete solution resulting from the linear system converges exponentially to the true solution of the order‐reduced system of ODEs. The coefficient matrix of the linear system is of block two‐by‐two structure, and each of its blocks is a combination of Toeplitz and diagonal matrices. Because of its algebraic properties and matrix structures, the linear system can be effectively solved by Krylov subspace iteration methods such as GMRES preconditioned by block‐diagonal matrices. We demonstrate that the eigenvalues of certain approximation to the preconditioned matrix are uniformly bounded within a rectangle on the complex plane independent of the size of the discretized linear system, and we use numerical examples to illustrate the feasibility and effectiveness of this new approach. Copyright © 2013 John Wiley & Sons, Ltd.     

A collocation method of lines for two‐sided space‐fractional advection‐diffusion equations with variable coefficients

We present the method of lines (MOL), which is based on the spectral collocation method, to solve space‐fractional advection‐diffusion equations (SFADEs) on a finite domain with variable coefficients. We focus on the cases in which the SFADEs consist of both left‐ and right‐sided fractional derivatives. To do so, we begin by introducing a new set of basis functions with some interesting features. The MOL, together with the spectral collocation method based on the new basis functions, are successfully applied to the SFADEs. Finally, four numerical examples, including benchmark problems and a problem with discontinuous advection and diffusion coefficients, are provided to illustrate the efficiency and exponentially accuracy of the proposed method.     

A monotone conservative Eulerian–Lagrangian scheme for reaction‐diffusion‐convection equations modeling chemotaxis

A numerical method for convection dominated diffusion problems, that exploits the use of characteristics, is derived and analyzed. It is shown to preserve positivity of solutions and be locally mass conserving. Stability, consistency and order one convergence are verified. Because of the way in which it determines characteristic pre‐images of grid cells, the method can be easily implemented for 1‐, 2‐, or 3‐dimensional problems on rectangular grids.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007