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.     

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     

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     

A multidomain integrated‐radial‐basis‐function collocation method for elliptic problems

This article is concerned with the use of integrated radial‐basis‐function networks (IRBFNs) and nonoverlapping domain decompositions (DDs) for numerically solving one‐ and two‐dimensional elliptic problems. A substructuring technique is adopted, where subproblems are discretized by means of one‐dimensional IRBFNs. A distinguishing feature of the present DD technique is that the continuity of the RBF solution across the interfaces is enforced with one order higher than with conventional DD techniques. Several test problems governed by second‐ and fourth‐order differential equations are considered to investigate the accuracy of the proposed technique. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Fundamental mode exact schemes for unsteady problems

The problem of increasing the accuracy of an approximate solution is considered for boundary value problems for parabolic equations. For ordinary differential equations (ODEs), nonstandard finite difference schemes are in common use for this problem. They are based on a modification of standard discretizations of time derivatives and, in some cases, allow to obtain the exact solution of problems. For multidimensional problems, we can consider the problem of increasing the accuracy only for the most important components of the approximate solution. In the present work, new unconditionally stable schemes for parabolic problems are constructed, which are exact for the fundamental mode. Such two‐level schemes are designed via a modification of standard schemes with weights using Padé approximations. Numerical results obtained for a model problem demonstrate advantages of the proposed fundamental mode exact schemes.     

Domain decomposition for radial basis meshless methods

Both overlapping and nonoverlapping domain decomposition methods (DDM) on matching and nonmatching grid have been developed to couple with the meshless radial basis function (RBF) method. Example shows that overlapping DDM with RBF can achieve much better accuracy with less nodal points compared to FDM and FEM. Numerical results also show that nonmatching grid DDM can achieve almost the same accuracy within almost the same iteration steps as the matching grid case; hence our method is very attractive, because it is much easier to generate nonmatching grid just by putting blocks of grids together (for both overlapping and nonoverlapping), where each block grid can be generated independently. Also our methods are showed to be able to handle discontinuous coefficient. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 450–462, 2004.     

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     

Monotonicity criteria for difference schemes designed for hyperbolic equations

Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations.     

Determination of a control parameter in a one-dimensional parabolic equation using the method of radial basis functions

In this work, the method of radial basis functions is used for finding the solution of an inverse problem with source control parameter. Because a much wider range of physical phenomena are modelled by nonclassical parabolic initial-boundary value problems, theoretical behavior and numerical approximation of these problems have been active areas of research. The radial basis functions (RBF) method is an efficient mesh free technique for the numerical solution of partial differential equations. The main advantage of numerical methods which use radial basis functions over traditional techniques is the meshless property of these methods. In a meshless method, a set of scattered nodes are used instead of meshing the domain of the problem. The results of numerical experiments are presented and some comparisons are made with several well-known finite difference schemes.     

On compact approximations of divergence differential equations

A method for the construction of compact difference schemes approximating divergence differential equations is proposed. The schemes have an arbitrarily prescribed order of approximation on general stencils. It is shown that the construction of such schemes for partial differential equations is based on special compact schemes approximating ordinary differential equations in several independent functions. Necessary and sufficient conditions on the coefficients of these schemes with high order of approximation are obtained. Examples of reconstruction of compact difference schemes for partial differential equations with these schemes are given. It is shown that such compact difference schemes have the same order of accuracy both for classical approximations on smooth solutions and weak approximations on discontinuous solutions.     

结构动力响应中急动度的计算

急动度(jerk)在工程实践中具有重要的意义.将径向基函数逼近与配点法相结合,发展了一种能够有效求解动力响应的数值算法.该方法使用径向基函数插值来逼近真实的运动规律,能够用于急动度和急动度(三阶)方程的计算,弥补了传统的数值方法无法计算急动度的不足.并针对微分方程的特点,提出了改进的多变量联合插值函数,同时添加与微分方程同阶的初值条件,可显著减小数值震荡.算例表明,该方法具有计算过程简单、精度高的特点,同时对急动度方程也有很好的适用性.     

求解半线性抛物问题的两种二重网格算法

用线性方法对半线性抛物问题进行求解。方法依赖粗、细二重网格,针对粗解在细网格上的修正提出了两种算法,算法1是乘积倍的增长精度而算法2是平方倍的增长精度,而且重复算法1、2的最后几步可以任意阶地逼近细网格上的非线性解。数值算例验证了算法的可行性和有效性。     

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     

Solving hyperbolic conservation laws using multiquadric quasi‐interpolation

In this article, we apply the univariate multiquadric (MQ) quasi‐interpolation to solve the hyperbolic conservation laws. At first we construct the MQ quasi‐interpolation corresponding to periodic and inflow‐outflow boundary conditions respectively. Next we obtain the numerical schemes to solve the partial differential equations, by using the derivative of the quasi‐interpolation to approximate the spatial derivative of the differential equation and a low‐order explicit difference to approximate the temporal derivative of the differential equation. Then we verify our scheme for the one‐dimensional Burgers' equation (without viscosity). We can see that the numerical results are very close to the exact solution and the computational accuracy of the scheme is ??(τ), where τ is the temporal step. We can improve the accuracy by using the high‐order quasi‐interpolation. Moreover the methods can be generalized to the other equations. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Numerical Integration of Harmonic Functions with Restricted Sampling Data

Based on the idea of kriging and the radial basis function approximation, we develop in this paper a numerical scheme to integrate harmonic functions with restricted sampling data. To be more precise, the integration is performed by using the function values which are given as discrete sampling data on only part of the boundary. These problems often arise from non-destructive evaluation techniques in the engineering industry. The existence and uniqueness of the solution and the error estimation for the proposed numerical scheme are also discussed. Several numerical experimental results are presented for the verification on the accuracy and convergence of the method.     

A local hermitian RBF meshless numerical method for the solution of multi‐zone problems

The local Hermitian interpolation (LHI) method is a strong‐form meshless numerical technique in which the solution domain is covered by a series of small and heavily overlapping radial basis function (RBF) interpolation systems. Aside from its meshless nature and the ability to work on very large scattered datasets, the main strength of the LHI method lies in the formation of local interpolations, which themselves satisfy both boundary and governing PDE operators, leading to an accurate and stable reconstruction of partial derivatives without the need for artificial upwinding or adaptive stencil selection. In this work, an extension is proposed to the LHI formulation which allows the accurate capture of solution profiles across discontinuities in governing equation parameters. Continuity of solution value and mass flux is enforced between otherwise disconnected interpolation systems, at the location of the discontinuity. In contrast to other local meshless methods, due to the robustness of the Hermite RBF formulation, it is possible to impose both matching conditions simultaneously at the interface nodes. The procedure is demonstrated for 1D and 3D convection–diffusion problems, both steady and unsteady, with discontinuities in various PDE properties. The analytical solution profiles for these problems, which experience discontinuities in their first derivatives, are replicated to a high degree of accuracy. The technique has been developed as a tool for solving flow and transport problems around geological layers, as experienced in groundwater flow problems. The accuracy of the captured solution profiles, in scenarios where the local convective velocities exceed those typically encountered in such Darcy flow problems, suggests that the technique is indeed suitable for modeling discontinuities in porous media properties. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1201–1230, 2011     

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 greedy meshless local Petrov–Galerkin methodbased on radial basis functions

The meshless local Petrov–Galerkin (MLPG) method with global radial basis functions (RBF) as trial approximation leads to a full final linear system and a large condition number. This makes MLPG less efficient when the number of data points is increased. We can overcome this drawback if we avoid using more points from the data site than absolutely necessary. In this article, we equip the MLPG method with the greedy sparse approximation technique of (Schaback, Numercail Algorithms 67 (2014), 531–547) and use it for numerical solution of partial differential equations. This scheme uses as few neighbor nodal values as possible and allows to control the consistency error by explicit calculation. Whatever the given RBF is, the final system is sparse and the algorithm is well‐conditioned. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 847–861, 2016     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

The dual reciprocity boundary elements method for the linear and nonlinear two‐dimensional time‐fractional partial differential equations

In this paper, we apply the dual reciprocity boundary elements method for the numerical solution of two‐dimensional linear and nonlinear time‐fractional modified anomalous subdiffusion equations and time‐fractional convection–diffusion equation. The fractional derivative of problems is described in the Riemann–Liouville and Caputo senses. We employ the linear radial basis function for interpolation of the nonlinear, inhomogeneous and time derivative terms. This method is improved by using a predictor–corrector scheme to overcome the nonlinearity which appears in the nonlinear problems under consideration. The accuracy and efficiency of the proposed schemes are checked by five test problems. The proposed method is employed for solving some examples in two dimensions on unit square and also in complex regions to demonstrate the efficiency of the new technique. Copyright © 2016 John Wiley & Sons, Ltd.