Spectral meshless radial point interpolation (SMRPI) method to two‐dimensional fractional telegraph equation

H. Ammari In this article, an innovative technique so‐called spectral meshless radial point interpolation (SMRPI) method is proposed and, as a test problem, is applied to a classical type of two‐dimensional time‐fractional telegraph equation defined by Caputo sense for (1 < α≤2). This new methods is based on meshless methods and benefits from spectral collocation ideas, but it does not belong to traditional meshless collocation methods. The point interpolation method with the help of radial basis functions is used to construct shape functions, which play as basis functions in the frame of SMRPI method. These basis functions have Kronecker delta function property. Evaluation of high‐order derivatives is not difficult by constructing operational matrices. In SMRPI method, it does not require any kind of integration locally or globally over small quadrature domains, which is essential of the finite element method (FEM) and those meshless methods based on Galerkin weak form. Also, it is not needed to determine strict value for the shape parameter, which plays an important role in collocation method based on the radial basis functions (Kansa's method). Therefore, computational costs of SMRPI method are less expensive. Two numerical examples are presented to show that SMRPI method has reliable rates of convergence. Copyright © 2015 John Wiley & Sons, Ltd.     

Numerical solutions of the Kawahara type equations using radial basis functions

This study is carried out to investigate the numerical solutions of the Kawahara, KdV‐Kawahara, and the modified Kawahara equations by using the meshless method based on collocation with radial basis functions. Results of the meshless method with different radial basis functions are presented for the travelling wave solution of the Kawahara type equations. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 542–553, 2012     

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     

Local radial basis function interpolation method to simulate 2D fractional‐time convection‐diffusion‐reaction equations with error analysis

In this article, a kind of meshless local radial point interpolation (MLRPI) method is proposed to two‐dimensional fractional‐time convection‐diffusion‐reaction equations and satisfactory agreements are archived. This method is based on meshless methods and benefits from collocation ideas but it does not belong to the traditional global meshless collocation methods. In MLRPI method, it does not need any kind of integration locally or globally over small quadrature domains which is essential in the finite element method and those meshless methods based on Galerkin weak form. Also, it is not needed to determine shape parameter which plays important role in collocation method based on the radial basis functions (Kansa's method). Therefore, computational costs of this kind of MLRPI method is less expensive. The stability and convergence of this meshless approach are discussed and theoretically proven. It is proved that the present meshless formulation is very effective for modeling and simulation of fractional differential equations. Furthermore, the numerical studies on sensitivity analysis and convergence analysis show the stability and reliable rates of convergence. © 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 974–994, 2017     

Spectral domain embedding for elliptic PDEs in complex domains

Spectral methods are a class of methods for solving partial differential equations (PDEs). When the solution of the PDE is analytic, it is known that the spectral solutions converge exponentially as a function of the number of modes used. The basic spectral method works only for regular domains such as rectangles or disks. Domain decomposition methods/spectral element methods extend the applicability of spectral methods to more complex geometries. An alternative is to embed the irregular domain into a regular one. This paper uses the spectral method with domain embedding to solve PDEs on complex geometry. The running time of the new algorithm has the same order as that for the usual spectral collocation method for PDEs on regular geometry. The algorithm is extremely simple and can handle Dirichlet, Neumann boundary conditions as well as nonlinear equations.     

对流占优扩散方程的特征线楔形基无网格法

本文研究了一维对流占优扩散方程的初边值问题.利用特征线法与楔形基无网格法,获得了特征线楔形基无网格显格式与隐格式算法.数值实验表明算法具有精度高、计算简单等优点.     

The generalized Dirichlet–Neumann map for linear elliptic PDEs and its numerical implementation

A new approach for analyzing boundary value problems for linear and for integrable nonlinear PDEs was introduced in Fokas [A unified transform method for solving linear and certain nonlinear PDEs, Proc. Roy. Soc. London Ser. A 53 (1997) 1411–1443]. For linear elliptic PDEs, an important aspect of this approach is the characterization of a generalized Dirichlet to Neumann map: given the derivative of the solution along a direction of an arbitrary angle to the boundary, the derivative of the solution perpendicularly to this direction is computed without solving on the interior of the domain. This is based on the analysis of the so-called global relation, an equation which couples known and unknown components of the derivative on the boundary and which is valid for all values of a complex parameter k. A collocation-type numerical method for solving the global relation for the Laplace equation in an arbitrary bounded convex polygon was introduced in Fulton et al. [An analytical method for linear elliptic PDEs and its numerical implementation, J. Comput. Appl. Math. 167 (2004) 465–483]. Here, by choosing a different set of the “collocation points” (values for k), we present a significant improvement of the results in Fulton et al. [An analytical method for linear elliptic PDEs and its numerical implementation, J. Comput. Appl. Math. 167 (2004) 465–483]. The new collocation points lead to well-conditioned collocation methods. Their combination with sine basis functions leads to a collocation matrix whose diagonal blocks are point diagonal matrices yielding efficient implementation of iterative methods; numerical experimentation suggests quadratic convergence. The choice of Chebyshev basis functions leads to higher order convergence, which for regular polygons appear to be exponential.     

Multiquadric quasi‐interpolation methods for solving partial differential algebraic equations

In this article, we propose two meshless collocation approaches for solving time dependent partial differential algebraic equations (PDAEs) in terms of the multiquadric quasi‐interpolation schemes. In presenting the process of the solution, the error is estimated. Furthermore, the comparisons on condition numbers of the collocation matrices using different methods and the sensitivity of the shape parameter c are given. With the use of the appropriate collocation points, the method for PDAEs with index‐2 is improved. The results show that the methods have some advantages over some known methods, such as the smaller condition numbers or more accurate solutions for PDAEs which has an modal index‐2 or an impulse solution with index‐2. Copyright © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 95–119, 2014     

Solving the Laplace equation by meshless collocation using harmonic kernels

We present a meshless technique which can be seen as an alternative to the method of fundamental solutions (MFS). It calculates homogeneous solutions of the Laplacian (i.e. harmonic functions) for given boundary data by a direct collocation technique on the boundary using kernels which are harmonic in two variables. In contrast to the MFS, there is no artificial boundary needed, and there is a fairly general and complete error analysis using standard techniques from meshless methods for the recovery of functions. We present two explicit examples of harmonic kernels, a mathematical analysis providing error bounds and convergence rates, and some illustrating numerical examples.     

Wavelets collocation methods for the numerical solution of elliptic BV problems

Based on collocation with Haar and Legendre wavelets, two efficient and new numerical methods are being proposed for the numerical solution of elliptic partial differential equations having oscillatory and non-oscillatory behavior. The present methods are developed in two stages. In the initial stage, they are developed for Haar wavelets. In order to obtain higher accuracy, Haar wavelets are replaced by Legendre wavelets at the second stage. A comparative analysis of the performance of Haar wavelets collocation method and Legendre wavelets collocation method is carried out. In addition to this, comparative studies of performance of Legendre wavelets collocation method and quadratic spline collocation method, and meshless methods and Sinc–Galerkin method are also done. The analysis indicates that there is a higher accuracy obtained by Legendre wavelets decomposition, which is in the form of a multi-resolution analysis of the function. The solution is first found on the coarse grid points, and then it is refined by obtaining higher accuracy with help of increasing the level of wavelets. The accurate implementation of the classical numerical methods on Neumann’s boundary conditions has been found to involve some difficulty. It has been shown here that the present methods can be easily implemented on Neumann’s boundary conditions and the results obtained are accurate; the present methods, thus, have a clear advantage over the classical numerical methods. A distinct feature of the proposed methods is their simple applicability for a variety of boundary conditions. Numerical order of convergence of the proposed methods is calculated. The results of numerical tests show better accuracy of the proposed method based on Legendre wavelets for a variety of benchmark problems.