A Cartesian‐grid collocation method based on radial‐basis‐function networks for solving PDEs in irregular domains

This paper reports a new Cartesian‐grid collocation method based on radial‐basis‐function networks (RBFNs) for numerically solving elliptic partial differential equations in irregular domains. The domain of interest is embedded in a Cartesian grid, and the governing equation is discretized by using a collocation approach. The new features here are (a) one‐dimensional integrated RBFNs are employed to represent the variable along each line of the grid, resulting in a significant improvement of computational efficiency, (b) the present method does not require complicated interpolation techniques for the treatment of Dirichlet boundary conditions in order to achieve a high level of accuracy, and (c) normal derivative boundary conditions are imposed by means of integration constants. The method is verified through the solution of second‐ and fourth‐order PDEs; accurate results and fast convergence rates are obtained. © 2007 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     

A local radial basis function collocation method to solve the variable‐order time fractional diffusion equation in a two‐dimensional irregular domain

The local radial basis function (RBF) method is a promising solver for variable‐order time fractional diffusion equation (TFDE), as it overcomes the computational burden of the traditional global method. Application of the local RBF method is limited to Fickian diffusion, while real‐world diffusion is usually non‐Fickian in multiple dimensions. This article is the first to extend the application of the local RBF method to two‐dimensional, variable‐order, time fractional diffusion equation in complex shaped domains. One of the main advantages of the local RBF method is that only the nodes located in the subdomain, surrounding the local point, need to be considered when calculating the numerical solution at this point. This approach can perform well with large scale problems and can also mitigate otherwise ill‐conditioned problems. The proposed numerical approach is checked against two examples with curved boundaries and known analytical solutions. Shape parameter and subdomain node number are investigated for their influence on the accuracy of the local RBF solution. Furthermore, quantitative analysis, based on root‐mean‐square error, maximum absolute error, and maximum error of the partial derivative indicates that the local RBF method is accurate and effective in approximating the variable‐order TFDE in two‐dimensional irregular domains.     

Rational Chebyshev collocation method for solving higher‐order linear ordinary differential equations

A collocation method to find an approximate solution of higher‐order linear ordinary differential equation with variable coefficients under the mixed conditions is proposed. This method is based on the rational Chebyshev (RC) Tau method and Taylor‐Chebyshev collocation methods. The solution is obtained in terms of RC functions. Also, illustrative examples are included to demonstrate the validity and applicability of the technique, and performed on the computer using a program written in maple9. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1130–1142, 2011     

A new Taylor collocation method for nonlinear Fredholm‐Volterra integro‐differential equations

The aim of this article is to present an efficient numerical procedure for solving nonlinear integro‐differential equations. Our method depends mainly on a Taylor expansion approach. This method transforms the integro‐differential equation and the given conditions into the matrix equation which corresponds to a system of nonlinear algebraic equations with unkown Taylor coefficients. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer program written in Maple10. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Indirect methods of collocation: Trefftz‐Herrera collocation

A nonstandard collocation method (TH‐collocation) is presented, where collocation is used to construct specialized weighting functions instead of the solution itself, as it is usual, so that in this sense it is an indirect method. TH‐collocation is shown to be as accurate as standard collocation, but computationally far more efficient. The present article is the first of a series devoted to explore thoroughly collocation methods. The following classification of collocation methods is introduced: direct‐nonoverlapping; indirect‐nonoverlapping; direct‐overlapping; and indirect‐overlapping. Most of the effort reported in the literature has gone to direct‐nonoverlapping methods. The procedure presented in this article falls into the indirect‐nonoverlapping category and it is based on Trefftz‐Herrera formulation. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 709–738, 1999     

A numerical method for one‐dimensional nonlinear Sine‐Gordon equation using collocation and radial basis functions

In this article, we propose a numerical scheme to solve the one‐dimensional undamped Sine‐Gordon equation using collocation points and approximating the solution using Thin Plate Splines (TPS) radial basis function (RBF). The scheme works in a similar fashion as finite difference methods. The results of numerical experiments are presented and are compared with analytical solutions to confirm the good accuracy of the presented scheme.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Exponential convergence and H‐c multiquadric collocation method for partial differential equations

The radial basis function (RBF) collocation method uses global shape functions to interpolate and collocate the approximate solution of PDEs. It is a truly meshless method as compared to some of the so‐called meshless or element‐free finite element methods. For the multiquadric and Gaussian RBFs, there are two ways to make the solution converge—either by refining the mesh size h, or by increasing the shape parameter c. While the h‐scheme requires the increase of computational cost, the c‐scheme is performed without extra effort. In this paper we establish by numerical experiment the exponential error estimate ? ～ O(λ^√c?h) where 0 < λ < 1. We also propose the use of residual error as an error indicator to optimize the selection of c. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 571–594, 2003     

Triangular splitting implementation of RKN‐type Fourier collocation methods for second‐order differential equations

A triangular splitting implementation of Runge–Kutta–Nyström–type Fourier collocation methods is presented and analyzed in this paper. The proposed implementation relies on a reformulation of the method and on the Crout factorization of a corresponding matrix associated with the method. The excellent behavior of the splitting implementation is confirmed by its performance on a few numerical tests.     

A Hermite collocation method for the approximate solutions of high‐order linear Fredholm integro‐differential equations

In this study, a Hermite matrix method is presented to solve high‐order linear Fredholm integro‐differential equations with variable coefficients under the mixed conditions in terms of the Hermite polynomials. The proposed method converts the equation and its conditions to matrix equations, which correspond to a system of linear algebraic equations with unknown Hermite coefficients, by means of collocation points on a finite interval. Then, by solving the matrix equation, the Hermite coefficients and the polynomial approach are obtained. Also, examples that illustrate the pertinent features of the method are presented; the accuracy of the solutions and the error analysis are performed. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1707–1721, 2011     

High order convergent modified nodal bi-cubic spline collocation method for elliptic partial differential equation

A high order modified nodal bi-cubic spline collocation method is proposed for numerical solution of second-order elliptic partial differential equation subject to Dirichlet boundary conditions. The approximation is defined on a square mesh stencil using nine grid points. The solution of the method exists and is unique. Convergence analysis has been presented. Moreover, the superconvergent phenomena can be seen in proposed one step method. The numerical results clearly exhibit the superiority of the new approximation, in terms of both accuracy and computational efficiency.     

A numerical study of the accuracy and stability of symmetric and asymmetric RBF collocation methods for hyperbolic PDEs

Differentiation matrices associated with radial basis function (RBF) collocation methods often have eigenvalues with positive real parts of significant magnitude. This prevents the use of the methods for time‐dependent problems, particulary if explicit time integration schemes are employed. In this work, accuracy and eigenvalue stability of symmetric and asymmetric RBF collocation methods are numerically explored for some model hyperbolic initial boundary value problems in one and two dimensions. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Least‐squares spectral collocation method for the Stokes equations

First‐order system least‐squares spectral collocation methods are presented for the Stokes equations by adopting the first‐order system and modifying the least‐squares functionals in 2 . Then homogeneous Legendre and Chebyshev (continuous and discrete) functionals are shown to be elliptic and continuous with respect to appropriate product weighted norms. The spectral convergence is analyzed for the proposed methods with some numerical experiments. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 128–139, 2004     

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     

Node adaptive domain decomposition method by radial basis functions

During the last years, there has been increased interest in developing efficient radial basis function (RBF) algorithms to solve partial differential problems of great scale. In this article, we are interested in solving large PDEs problems, whose solution presents rapid variations. Our main objective is to introduce a RBF dynamical domain decomposition algorithm which simultaneously performs a node adaptive strategy. This algorithm is based on the RBFs unsymmetric collocation setting. Numerical experiments performed with the multiquadric kernel function, for two stationary problems in two dimensions are presented. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A new superconvergent collocation method for eigenvalue problems

Here we propose a new method based on projections for the approximate solution of eigenvalue problems. For an integral operator with a smooth kernel, using an interpolatory projection at Gauss points onto the space of (discontinuous) piecewise polynomials of degree , we show that the proposed method exhibits an error of the order of for eigenvalue approximation and of the order of for spectral subspace approximation. In the case of a simple eigenvalue, we show that by using an iteration technique, an eigenvector approximation of the order can be obtained. This improves upon the order for eigenvalue approximation in the collocation/iterated collocation method and the orders and for spectral subspace approximation in the collocation method and the iterated collocation method, respectively. We illustrate this improvement in the order of convergence by numerical examples.

     

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.     

Radial basis function collocation method for the numerical solution of the two-dimensional transient nonlinear coupled Burgers’ equations

This paper examines the numerical solution of the transient nonlinear coupled Burgers’ equations by a Local Radial Basis Functions Collocation Method (LRBFCM) for large values of Reynolds number (Re) up to 10³. The LRBFCM belongs to a class of truly meshless methods which do not need any underlying mesh but works on a set of uniform or random nodes without any a priori node to node connectivity. The time discretization is performed in an explicit way and collocation with the multiquadric radial basis functions (RBFs) are used to interpolate diffusion-convection variable and its spatial derivatives on decomposed domains. Five nodded domains of influence are used in the local support. Adaptive upwind technique [1] and [54] is used for stabilization of the method for large Re in the case of mixed boundary conditions. Accuracy of the method is assessed as a function of time and space discretizations. The method is tested on two benchmark problems having Dirichlet and mixed boundary conditions. The numerical solution obtained from the LRBFCM for different value of Re is compared with analytical solution as well as other numerical methods [15], [47] and [49]. It is shown that the proposed method is efficient, accurate and stable for flow with reasonably high Reynolds numbers.     

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     

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.