Open access peer-reviewed chapter

# Applications of Radial Basis Function Schemes to Fractional Partial Differential Equations

By Carlos Alberto Torres Martínez and Carlos Fuentes

Submitted: November 11th 2016Reviewed: February 15th 2017Published: June 14th 2017

DOI: 10.5772/67892

Downloaded: 1664

## Abstract

In modeling using diffusion equations, the relationship between fractal geometry and fractional calculus arises by modeling the conditions of the medium as a fractal whose fractional dimension determines the order of this equation. For this reason, it is very useful to have numerical methods that solve them and discretization of the domain is not determinant for the efficiency of the algorithm. In this work, it is proposed to show that meshless methods, in particular methods with radial basis functions (RBF), are an alternative to schemes in differences or structured meshes. We show that we can obtain numerical solutions to some fractional partial differential equations using collocation and RBF, over non equally distributed data.

### Keywords

• fractional partial differential equations (FPDE)
• meshless methods
• radial basis functions (RBF)
• Caputo derivative
• Riemann-Liouville derivative
• Riesz derivative
• diffusion-convection

## 1. Background

### 1.1. Radial basis function methodology

The Hardy-based radial-based functions (RBF) methodology  arises from the need to apply multivariate interpolation to cartography problems, with randomly dispersed data (also known as collocation nodes). Micchelli , Powell et al.  gave it a great boost by proving non-singularity theorems. Later, Kansa [4, 5] proposed to consider the analytical derivatives of the FBR to develop numerical schemes that deal with partial differential equations (PDE).

Regarding PDE over spaces of dimension greater than one, we generally opt for finite element (FE) type discretizations on meshes, structured or not; also pseudo spectral (PS) methods through base functions such as Fourier or Chebyshev. The high degree of computational efficiency in the procedure raises the cost in the regularity constraints on the form of the computational domain.

The FE methods involve decomposition of the domain; for example, in two dimensions rectangles are constructed with curvilinear mappings that allow the refinement of the mesh in critical areas. However, this type of implementation is complex and very close nodes are needed, mainly at the domain boundaries, which impairs stability conditions in time.

For this reason, we look for numerical techniques that do not depend to a great extent on data distribution. RBF collocation methods belong to the “meshfree” methods; that is, they only require scattered collocation nodes on the domain and the boundary. They are also an alternative for dealing with problems in larger dimensions and irregular domains. Hence, in recent decades, such methods have attracted the attention of researchers in order to solve partial differential equations. See for example: Chen et al. .

This type of technique approximates the solution by means of a linear combination of radial basis functions, which are globally defined and of exponential convergence, but they produce dense and badly conditioned interpolation matrices. On the other hand, some RBFs contain a shape parameter, a number that influences the precision of the numerical results [7, 8].

There are algorithms that also produce better conditioned interpolants, even when the shape parameter tends to zero, with a double precision arithmetic. Some of them are: Contour-Padé and RBF-QR. Related to the latter is the recent RBF-GA .

The RBF-QR method provides a numerically more stable alternative for converting basis that are very similar to each other, or almost linearly dependent on a set of scattered nodes, to a very well conditioned base that generates exactly the same space. This method was originally implemented for nodes on the surface of a sphere in Fornberg and Piret . And recently for an arbitrary set of nodes in one, two, and three dimensions [12, 13].

### 1.2. Fractional calculus and differential equations: about some applications

The growing interest in fractional calculus has been motivated by applications of fractional equations in different fields of research.

One of the applications considered in this work is that of convection-diffusion equations, which appear not only in many applications of models in Physics and Chemistry , in problems of flow or heat transfer, but also in other fields such as financial [18, 19]. The solution of a convection-diffusion problem can be interpreted as a probability distribution of one or more underlying stochastic processes . The classical diffusion equation (or heat equation) and its Gaussian solution existed long before Einstein established a connection with random walks.

The anomalous diffusion equations, on the other hand, were originally developed from stochastic walks models . The parameters of these equations are uniquely determined by the fractal dimension of the underlying object .

Recent applications of these anomalous diffusion-convection models—those related to oil extraction and hydrological models for aquifers, food production and water distribution in large cities, are quite important . Determining the behavior of the fluid inside the reservoir and the loss of permeability of the medium assists in the investigation of the mechanisms of oil migration. In this context, the geometric and physical interpretation of fractional derivatives in these differential equations is a “ultra slow” or “ultra fast” diffusion.

The relationship between fractal geometry and fractional calculus is given from the consideration that a particle moves in a porous medium with fractal structure . Thus, when considering the derivative over that variable, a fractional derivative is obtained.

Fuentes et al. [24, 25] proposed a model that represents anomalous diffusion of petroleum (very fast or very slow) in three types of medium with different porosities: fractures, vugs and matrix. This model has a dimensionless form, which is seen as

(1ωfωυ)α1pmtα1=(1κfκυ)1rr(rβ1pmrβ1)+λmf(pfpm)+λmυ(pυpm),E1
ωfα2pftα2=κf1rr(rβ2pmrβ2)λmf(pfpm)+λfυ(pυpf),E2
ωυα3pυtα3=κv1rr(rβ3pmrβ3)λmv(pυpm)+λfυ(pυpf).E3

This model must be solved for p’s (pressure) at time tin the matrix of the medium pm, the fractured medium pf, and the vugular medium pv .

κrepresents each permeability tensor, which is assumed to be constant; ris the dimensionless variable related to the ratios of the wellbore. Values λare dimensionless values and they are defined in terms of transfer coefficients at each interface, the radius of the wellbore, the dynamic viscosity of the fluid and the permeability tensor.

If time orders α’s are less than one we say that the process is subdiffusiveand if it is greater than one it is called superdiffusive. Spatial orders β’s result from generalizing the classic Darcy law, which corresponds to β= 1.

The above equations, like the flow equation that considers the medium as a whole, are modified Bessel’s equations.

Different porosities imply different fractal dimensions and therefore, fractional derivatives with different orders.

In Fractional Calculus there is not a single definition of derivative and between these definitions, in general, not equivalent to each other. Definitions such as Riemann-Liouville, Riesz, Caputo, Weyl or Grünwald-Letnikov are the most used to model anomalous diffusion, from a porous medium with fractal dimension.

But, fractional equations present serious numerical and mathematical difficulties in the context of diffusion equations. From the computational point of view, the challenge to overcome is to attenuate the numerical cost of the matrices that result in discretizing the problem. The proposal is to consider radial basis interpolators , taking into account that the domain geometry does not determine the efficiency of the algorithm and sounds like an immediate alternative for generalizing larger dimensions.

Advertisement

## 2. Introduction

The objective in this work is to deal with fractional differential operators, using radial basis functions (RBF) and optimizing discretization processes of such fractional operators, through QR matrix decomposition and to attenuate the bad condition due to the shape parameter. With RBF-QR, a very high precision and convergence are obtained without the need to increase a polynomial term to the interpolator . As the computational cost increases, so does the range of problems to which such a technique can be applied.

## 3. Radial basis function method for interpolation

Definition 1. Let s be a positive integer, a functionϕ:RsRis calledradialwhenever there is a function in one variableϕ:[0,)Rsuch that

ϕ(x)=ϕ(r),wherer=||x||E4

and||||is a norm inRs(usually the Euclidean standard norm).Table (1)shows some examples, about the more used real functionsϕ(r).

RBF nameRBF ϕ(r)
Piecewiese smooth, global
Polyharmonic splinerm, m=1,3,5,
rmln(r), m=2,4,6,
Compact support (’Wendland’)(1εr)+mp(εr), ppolynomial.
Smooth, global
Gaussian (GA)e(εr)2
Multiquadric (MQ)1+(εr)2
Inverse quadric (IQ)1/(1+(εr)2)
Inverse multiquadric (IMQ)1/1+(εr)2
Bessel (BE) (d=1,2,)Jd/21(εr)/(εr)d/21

### Table 1.

Common elections for ϕ(r).

A standard interpolator in terms of radial basis functions, given the data uk, of some real function u, in the corresponding collocation nodesxk, k=1,,N, has the form 

sε(x)=k=1Nλkϕ(ε||xxk||)E5

where ϕis one real variable function and the constant value εis called shape parameter.

Note 1. The radial basis function (FBR) we will take for the approach and examples is theGaussian function:

ϕ(r)=er2r0.E6

Because it is globally smooth and for which the RBF method can be applied together with QR matrix decomposition.

Notation 1. Considering one dimensional case, we abbreviateϕk(x):=ϕ(ε||xxk||). Now the interpolator (5) is written as

sε(x)k=1Nλkϕk(x).E7

The unknown coefficients λkcan be determined by interpolation conditions

sε(xi)=ui,i=1,,N.

producing the linear equations system

λ1ϕ1(x1)++λNϕN(x1)=u1λ1ϕ1(xN)++λNϕN(xN)=uN

which can be described in matrix form

[ϕ1(x1)ϕN(x1)ϕ1(xN)ϕN(xN)]A[λ1λN]λ=[u1uN]uX.

Thus

Aλ=uX,whereA=[Φ(x1)TΦ(xN)T]andΦ(x):=[ϕ1(x)ϕN(x)].E8

Ais called Gram matrix.

## 4. RBF methodology for the discretization of differential operators

Suppose we want to apply a differential operator Lto the function u(x)in every evaluation nodefrom the set Z={z1,,zNe}, given the values of the function at collocation nodes X={x1,,xN}

LuZDuX.E9

where LuZ=[Lu(z1)Lu(zNe)]and uX=[u(x1)u(xN)].

Assuming that Lis linear, we apply it to the RBF interpolator, for each of the evaluation nodes, as an approximation to the values of Lin u:

Lsε(zi)=k=1NλkLϕk(zi),    i=1,2,,Ne;L(sε(z1))=λ1Lϕ1(z1)++λNLϕN(z1)L(sε(zNe))=λ1Lϕ1(zNe)++λNLϕN(zNe)E10

which in the matrix form is

Lsε=BλE11

where

Lsε=[L(sε(z1))L(sε(zNe))],B=[Lϕ1(z1)LϕN(z1)Lϕ1(zNe)LϕN(zNe)].

The coefficient matrix λ=[λ1λN]is calculated by solving for λin Eq. (8). In this way, from Eq. (11) we obtain

Lsε=(BA1)uX.E12

Thus, the matrix BA−1 is that matrix Dwhich is mentioned in Eq. (9) and that approximates the values of the differential operator applied to the function.

## 5. Fractional calculus definitions

The definitions shown in this section are based on the texts of Podlubny  and Samko .

Generalizing the formula of Cauchy, we obtain

Jn(f(t)):=0tf(τ)dτ=1(n1)!0t(tτ)n1f(τ)dτ

Definition 2. Theleft-sided Riemann-Liouville fractional integralof order α of function f(x) is defined as

aRLIxαf(x)=1Γ(α)ax(xτ)α1f(τ)dτ, x>a.E13

Definition 3. Theright-sided Riemann-Liouville fractional integralof order α of function f(x) is defined as

xRLIbαf(x)=1Γ(α)xb(τx)α1f(τ)dτ, x<b.E14

Based on the definition of fractional integral, the following fractional derivatives are constructed, which we will use in the numerical examples

Definition 4. Theleft-sided Riemann-Liouville fractional derivativeof order α of function f(x) is defined as

aRLDxαf(x)=1Γ(mα)dmdxmax(xτ)mα1f(τ)dτ, x>a,E15

wherem=α.

Definition 5. Theright-sided Riemann-Liouville fractional derivativeof order α of function f(x) is defined as

xRLDbαf(x)=(1)mΓ(mα)dmdxmxb(τx)mα1f(τ)dτ, x<b,E16

wherem=α.

Definition 6.  TheRiesz fractional operatorfor α on a finite interval0xLis defined as

α|x|αf(x,t)=cα(aRLDxα+xRLDbα)f(x,t),E17

where

cα=12cos(πα2), α1,E18
aRLDxαf(x,t)=1Γ(mα)dmdxmax(xτ)mα1f(τ,t)dτ,E19
xRLDbαf(x,t)=(1)mΓ(mα)dmdxmxb(τx)mα1f(τ,t)dτ,E20

wherem=α.

Definition 7. Theleft-sided Caputo fractional derivativeof order α of function f(x) is defined as

aCDxαf(x)=1Γ(mα)ax(xτ)mα1f(m)(τ)dτ, x>a,E21

andm=α.

The fact that the derivative of integer order appears within the integral in Definition 7, makes Caputo derivative the most suitable for dealing with initial conditions of the FPDEs.

Definition 8. Theright-sided Caputo fractional derivativeof order α of function f(x) is defined as

xCDbαf(x)=(1)mΓ(mα)xb(τx)mα1f(m)(τ)dτ, x<b,E22

andm=α.

Advertisement

## 6. Numerical examples

### 6.1. Fractional partial differential equation with Riesz space fractional derivatives

The equation that we take in this part is the advection-diffusion equation (see [30, 6]).

u(x,t)t=Kααu(x,t)|x|α, x[0,π], t(0,T],u(x,0)=u0(x),u(0,t)=u(π,t)=0,E23

where ucan be, for example, the concentration of a dissolute substance, Kαthe dispersion coefficient and the fractional derivative of Riesz is given with fractional order 1<α2.

Taking advantage of the fact that for RBFs we can consider non-equispaced collocation nodes, we divide the interval [0,π]into Nnodes, using Chebyshev distribution (see Figure 1): Figure 1.Chebyshev nodes distribution over[0,π]interval.
xi=π2cos(θi)+π2,  θi=πiπN1, i=0,1,,N1.

The FPDE is solved by the method of lines based on the spatial trial spaces spanned by the Lagrange basis associated to RBFs. The Lagrange basis L1(x),,LN(x)is generated by radial functions ϕj(x)=ϕ(|xxj|), j=1,2,,N, taking into account the collocation nodes. This is done by solving the system

L(x)T=Φ(x)TA1E24

where

L(x)T=[L1(x)LN(x)], Φ(x)T=[ϕ1(x)ϕN(x)]E25

and the Gram matrix

A=[ϕ1(x1)ϕN(x1)ϕ1(xN)ϕN(xN)].

If Lis a differential operator and RBF φis sufficiently smooth, then the application of such operator to the Lagrange base is calculated through the relation

(LL)(x)=(Lϕ)A1.

Because of Lagrange’s standard conditions, the zero boundary conditions in x1=0and xN=πare de facto fulfilled if we use an approximation generated by the functions L2,,LN1. This approximation is then represented as

u(x,t)=j=2N1βj(t)Lj(x),

with unknown vector

β(t)=[β2(t)βN1(t)].

Evaluating the interpolator at the PDE in each node xi, we obtain

j=2N1βj(t)Lj(xi)=Kαj=2N1βj(t)α|x|αLj(xi)

and initial conditions

βj(0)=u0(xj), 2jN1.

From the latter two equations we obtain the following system of ordinary differential equations

β(t)=Kα(α|x|αL)β(t),  β(0)=U0,

where

α|x|αL=[α|x|αL2(x2)α|x|αLN1(x2)α|x|αL2(xN)α|x|αLN1(xN)] and U0=[u0(x2)u0(xN1)].E26

According to the equation data in articles [30, 6], the problem (23) is taken with parameters α=1.8, Kα=0.25and u0(x)=x2(πx). For the numerical solution, Gaussian RBF is used with a shape parameter ε=0.8, applying the scheme shown in Section 6.1. Graphs are shown in Figure 2. Figure 2.RBF approximation to solution, forEq. (23), withα=1.8,ε=0.8andKα=0.25.

### 6.2. Riemann-Liouville space-fractional diffusion equation

In this part we consider the problem introduced by Sousa  and taken up in Ref.  by Cécile and Hanert, the fractional diffusion equation in one dimension

f(x,t)t=d(x)0RLDxαf(x,t)+q(x,t), x[0,1]andt>0E27

with 0RLDxαRiemannn-Liouville derivative, 1<α2,

d(x)=Γ(5α)24xα y q(x,t)=2etx4.

Initial conditions are considered

f(x,0)=x4, x(a,b)E28

and Dirichlet boundary conditions

f(0,t)=0, f(1,t)=et.E29

The exact solution to Eq. (27) is

f(x,t)=etx4.

We apply RBF and the method of lines with Lagrange polynomials, in a similar way as it was applied in Section 6.1. With N=21Chebyshev collocation nodes and Ne=100evaluation nodes, various values for the order of the derivative αand for shape parameters.

The results obtained by Sousa  were obtained by applying implicit Crank-Nicholson schemes for time. The discretization of the fractional derivative was done using splines, with second-order precision. The results of both Sousa and RBF are shown in Tables 2 and 3, taking into account the error

 Globalℓ∞error (30) of time converged solution for three mesh resolutions att=1forα=1.2,α=1.4andΔt=Δx. Δx α=1.2 Rate α=1.4 Rate 1/15 0.1275×10−2 0.9070×10−3 1/20 0.7571×10−3 1.8 0.5327×10−3 1.8 1/25 0.5030×10−3 1.8 0.3486×10−3 1.9 1/30 0.3566×10−3 1.9 0.2461×10−3 1.9 Global ℓ∞error (30) of time converged solution for three mesh resolutions at t=1for α=1.5, α=1.8and Δt=Δx. Δx α=1.5 Rate α=1.8 Rate 1/15 0.7660×10−3 0.4380×10−3 1/20 0.4493×10−3 1.9 0.2540×10−3 1.9 1/25 0.2929×10−3 1.9 0.1649×10−3 1.9 1/30 0.2067×10−3 1.9 0.1150×10−3 2.0

### Table 2.

Comparison of results for FPDE (27): Sousa results .

 Globalℓ∞error (30) of time converged solutions att=1forα=1.2,1.4,1.5,1.8and shape parametersε=0.6,1.2. ε=0.6 (r)1-2 Order Maximal error ε=1.2 α=1.2 0.35574×10−4 α=1.4 0.46508×10−4 α=1.5 0.60498×10−4 α=1.8 0.16994×10−4 0.18125×10−4

### Table 3.

Comparison of results for FPDE (27): RBF results.

||uexactuapproximated||E30

where ||||is the norm.

### 6.3. Caputo time fractional partial differential equations

In this part we consider examples of fractional partial differential equations (see ) of the type

αu(x,t)tα+δu(x,t)x+γ2u(x,t)x2=f(x,t),E31

where t>0,x[a,b], 0<α1, δand γare real parameters, bounded initial condition u(x,0) =u0(x)and Dirichlet boundary conditions u(a,t)=g1(t)and u(b,t)=g2(t), t0. Caputo Derivative will be considered and rbf-qr routines from www.it.uu.se/research/scientific_computing/software/rbf_qr

#### 6.3.1. Example 1

Putting δ=1,γ=1and f(x,t)=2t2αΓ(3α)+2x2in Eq. (31), we obtain a non-homogeneous, fractional and linear Burger equation

αu(x,t)tα+u(x,t)x2u(x,t)x2=2t2αΓ(3α)+2x2.E32

Using initial condition

u(x,0)=x2,E33

Dirichlet boundary conditions

u(0,t)=t2, u(1,t)=1+t2.E34

The exact solution (see ) is

u(x,t)=x2+t2,E35

This problem is solved using the method described in section 6.1 along with QR decomposition for spatial part and an implicit scheme for time, on domain [0,1], fractional derivative of order α=0.5; several shape parameters are considered and the one that gives the best approximation is taken. Figure 3 shows a 3D image of the solution and maximal error for the solution at time t=1. Figure 3.Numerical solution forEq. (32)withα=0.5.

In Figure 4 we compare errors that result when choosing uniform collocation nodes (with a fixed step size) and Chebyshev, on definition interval [0,1]. The election of Chebyshev nodes is due to attenuating instability, which manifests as oscillations in the graph, called the Gibbs phenomenon [34, 35]. Figure 4.Comparison between results forEq. (32)withα=0.5andt=0.5, due to election of nodes. (a) 41 uniform collocation nodes and 100 evaluation nodes, maximal error fort=0.5,α=0.5,ε=3.6is0.83595×10−4. (b) 41 Chebyshev collocation nodes and 100 evaluation nodes, maximal error fort=0.5,α=0.5,ε=3.6is0.14385×10−4.

[41 uniform collocation nodes and 100 evaluation nodes, maximal error for t=0.5, α=0.5, ε=3.6is 0.83595×104.] [41 Chebyshev collocation nodes and 100 evaluation nodes, maximal error for t=0.5, α=0.5, ε=3.6is 0.14385×104.]

#### 6.3.2. Example 2

Putting δ=1, γ=0and f(x,t)=t1αΓ(2α)sin(x)+tcos(x)in Eq. (31), we obtain

αu(x,t)tα+u(x,t)x=t1αΓ(2α)sin(x)+tcos(x).E36

Initial condition

u(x,0)=0,E37

Next function is the exact solution (see ), which is used to set boundary conditions.

u(x,t)=tsinx.E38

The problem is solved by Lagrange (like Section 6.1) and RBF-QR, for α=0.6, N=121collocation nodes on interval [3,3]. In Figure 5 we notice that when the number of uniform collocation nodes grows, there are large oscillations which cause unstability. For this reason, Chebyshev nodes are also preferred, as they attenuate this misbehavior. Figure 5.Unstability due to node election, forEq. (36). (a) 121 uniform collocation nodes and 101 evaluation nodes, maximal error fort=2,α=0.6,ε=1.5is0.10558×1019. (b) 121 Chebyshev collocation nodes and 101 evaluation nodes, maximal error fort=2,α=0.6,ε=0.2is0.71054×10−15.

#### 6.3.3. Example 3

Putting δ=0,γ=1and f(x,t)=0in Eq. (31), we obtain

αu(x,t)tα=2u(x,t)x2.E39

using initial condition

u(x,0)=4x(1x),E40

boundary conditions

u(0,t)=u(1,t)=0.E41

The exact solution of this problem is not known, but is shown as an example of subdiffusive phenomenon which was discussed in the introduction. The problem is solved using the method described in section 6.1 along with QR decomposition for spatial part and an implicit scheme for time, on domain [0,1], fractional derivative of order α=0.5and α=0.7, according to the results shown in Refs. [36, 32]. Figures 6 and 7 show these results. Figure 8 shows a what if situation when α=1.2(superdiffusive phenomenon), mentioned in Section 1.2. Figure 6.Numerical solution forequation (39), orderα=0.5(superdiffusive phenomenon). Figure 7.Numerical solution forEq. (39), orderα=0.7(subdiffusive phenomenon). Figure 8.Numerical solution forEq. (39), orderα=1.2(superdiffusive phenomenon).

## 7. Discussion

The idea was to show that radial basis schemes are efficient and are on par with schemes like Finite Differences. They are an option to deal with multidimensional and irregular domain problems. The challenge is to adapt them to deal with diffusive problems, particularly with multidimensional systems of equations that consider that the medium does not have a single characteristic.

Fuentes et al. show in the work “The fractal models of saturated and unsaturated flows (capillary, diffusion and matrix) at micro, macro and mega scales”, for the PEMEX oil company, how to model the pressure which the oil must leave in a wellbore, from a system of triple porosity and permeability of the fractured medium.

By converting the model into a dimensionless system, in terms of radial distances, non-mesh schemes such as RBFs sound like a viable option and it is a work that is still being addressed.

## Download for free

chapter PDF
Citations in RIS format
Citations in bibtex format

## More

© 2017 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## How to cite and reference

### Cite this chapter Copy to clipboard

Carlos Alberto Torres Martínez and Carlos Fuentes (June 14th 2017). Applications of Radial Basis Function Schemes to Fractional Partial Differential Equations, Fractal Analysis - Applications in Physics, Engineering and Technology, Fernando Brambila, IntechOpen, DOI: 10.5772/67892. Available from:

### chapter statistics

1664total chapter downloads

1Crossref citations

### More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

### Related Content

Next chapter

#### Application of Fractional Calculus to Oil Industry

By Benito F. Martínez-Salgado, Rolando Rosas-Sampayo, Anthony Torres-Hernández and Carlos Fuentes

First chapter

#### Fractal Analysis of Cardiovascular Signals Empowering the Bioengineering Knowledge

By Ricardo L. Armentano, Walter Legnani and Leandro J. Cymberknop

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.