An integral operational matrix based on Jacobi polynomials for solving fractional-order differential equations

This paper aims to construct a general formulation for the Jacobi operational matrix of fractional integral operator. Fractional calculus has been used to model physical and engineering processes that are found to be best described by fractional differential equations. Therefore, a reliable and efficient technique for the solution of them is too important. For the concept of fractional derivative we will adopt Caputo’s definition by using Riemann–Liouville fractional integral operator. Our main aim is to generalize the Jacobi integral operational matrix to the fractional calculus. These matrices together with the Tau method are then utilized to reduce the solution of this problem to the solution of a system of algebraic equations. The method is applied to solve linear and nonlinear fractional differential equations. Illustrative examples are included to demonstrate the validity and applicability of the presented technique.     

A fractional‐order Jacobi Tau method for a class of time‐fractional PDEs with variable coefficients

This paper presents a shifted fractional‐order Jacobi orthogonal function (SFJF) based on the definition of the classical Jacobi polynomial. A new fractional integral operational matrix of the SFJF is presented and derived. We propose the spectral Tau method, in conjunction with the operational matrices of the Riemann–Liouville fractional integral for SFJF and derivative for Jacobi polynomial, to solve a class of time‐fractional partial differential equations with variable coefficients. In this algorithm, the approximate solution is expanded by means of both SFJFs for temporal discretization and Jacobi polynomials for spatial discretization. The proposed tau scheme, both in temporal and spatial discretizations, successfully reduced such problem into a system of algebraic equations, which is far easier to be solved. Numerical results are provided to demonstrate the high accuracy and superiority of the proposed algorithm over existing ones. Copyright © 2015 John Wiley & Sons, Ltd.     

A Note on Parallel Preconditioning for the All-at-Once Solution of Riesz Fractional Diffusion Equations

The $p$-step backward difference formula (BDF) for solving systems of ODEs can be formulated as all-at-once linear systems that are solved by parallel-in-time preconditioned Krylov subspace solvers (see McDonald et al. [36] and Lin and Ng [32]). However, when the BDF$p$ (2 ≤ $p$ ≤ 6) method is used to solve time-dependent PDEs, the generalization of these studies is not straightforward as $p$-step BDF is not selfstarting for $p$ ≥ 2. In this note, we focus on the 2-step BDF which is often superior to the trapezoidal rule for solving the Riesz fractional diffusion equations, and show that it results into an all-at-once discretized system that is a low-rank perturbation of a block triangular Toeplitz system. We first give an estimation of the condition number of the all-at-once systems and then, capitalizing on previous work, we propose two block circulant (BC) preconditioners. Both the invertibility of these two BC preconditioners and the eigenvalue distributions of preconditioned matrices are discussed in details. An efficient implementation of these BC preconditioners is also presented, including the fast computation of dense structured Jacobi matrices. Finally, numerical experiments involving both the one- and two-dimensional Riesz fractional diffusion equations are reported to support our theoretical findings.     

A new Jacobi operational matrix: An application for solving fractional differential equations

In this paper, we derived the shifted Jacobi operational matrix (JOM) of fractional derivatives which is applied together with spectral tau method for numerical solution of general linear multi-term fractional differential equations (FDEs). A new approach implementing shifted Jacobi operational matrix in combination with the shifted Jacobi collocation technique is introduced for the numerical solution of nonlinear multi-term FDEs. The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations which greatly simplifying the problem. The proposed methods are applied for solving linear and nonlinear multi-term FDEs subject to initial or boundary conditions, and the exact solutions are obtained for some tested problems. Special attention is given to the comparison of the numerical results obtained by the new algorithm with those found by other known methods.     

Traveling wave solutions for fractional partial differential equations arising in mathematical physics by an improved fractional Jacobi elliptic equation method

In this paper, combining with a new generalized ansätz and the fractional Jacobi elliptic equation, an improved fractional Jacobi elliptic equation method is proposed for seeking exact solutions of space‐time fractional partial differential equations. The fractional derivative used here is the modified Riemann‐Liouville derivative. For illustrating the validity of this method, we apply it to solve the space‐time fractional Fokas equation and the the space‐time fractional BBM equation. As a result, some new general exact solutions expressed in various forms including the solitary wave solutions, the periodic wave solutions, and Jacobi elliptic functions solutions for the two equations are found with the aid of mathematical software Maple. Copyright © 2016 John Wiley & Sons, Ltd.     

Sine‐cosine wavelet method for fractional oscillator equations

Purpose In this article, a novel computational method is introduced for solving the fractional nonlinear oscillator differential equations on the semi‐infinite domain. The purpose of the proposed method is to get better and more accurate results. Design/methodology/approach The proposed method is the combination of the sine‐cosine wavelets and Picard technique. The operational matrices of fractional‐order integration for sine‐cosine wavelets are derived and constructed. Picard technique is used to convert the fractional nonlinear oscillator equations into a sequence of discrete fractional linear differential equations. Operational matrices of sine‐cosine wavelets are utilized to transformed the obtained sequence of discrete equations into the systems of algebraic equations and the solutions of algebraic systems lead to the solution of fractional nonlinear oscillator equations. Findings The convergence and supporting analysis of the method are investigated. The operational matrices contains many zero entries, which lead to the high efficiency of the method, and reasonable accuracy is achieved even with less number of collocation points. Our results are in good agreement with exact solutions and more accurate as compared with homotopy perturbation method, variational iteration method, and Adomian decomposition method. Originality/value Many engineers can utilize the presented method for solving their nonlinear fractional models.     

On the convergence of basic iterative methods for convection–diffusion equations

In this paper we analyze convergence of basic iterative Jacobi and Gauss–Seidel type methods for solving linear systems which result from finite element or finite volume discretization of convection–diffusion equations on unstructured meshes. In general the resulting stiffness matrices are neither M‐matrices nor satisfy a diagonal dominance criterion. We introduce two newmatrix classes and analyse the convergence of the Jacobi and Gauss–Seidel methods for matrices from these classes. A new convergence result for the Jacobi method is proved and negative results for the Gauss–Seidel method are obtained. For a few well‐known discretization methods it is shown that the resulting stiffness matrices fall into the new matrix classes. Copyright © 1999 John Wiley & Sons, Ltd.     

Simulation of nonlinear fractional dynamics arising in the modeling of cognitive decision making using a new fractional neural network

By the rapid growth of available data, providing data-driven solutions for nonlinear (fractional) dynamical systems becomes more important than before. In this paper, a new fractional neural network model that uses fractional order of Jacobi functions as its activation functions for one of the hidden layers is proposed to approximate the solution of fractional differential equations and fractional partial differential equations arising from mathematical modeling of cognitive-decision-making processes and several other scientific subjects. This neural network uses roots of Jacobi polynomials as the training dataset, and the Levenberg-Marquardt algorithm is chosen as the optimizer. The linear and nonlinear fractional dynamics are considered as test examples showing the effectiveness and applicability of the proposed neural network. The numerical results are compared with the obtained results of some other networks and numerical approaches such as meshless methods. Numerical experiments are presented confirming that the proposed model is accurate, fast, and feasible.     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

Block Pulse算子矩阵法求解变系数时间分数阶对流扩散方程（英文）

The numerical technique based on two-dimensional block pulse functions(2D-BPFs) is proposed for solving the time fractional convection diffusion equations with variable coeficients(FCDEs).We introduce the block pulse operational matrices of the fractional order differentiation.Furthermore,we translate the original equation into a Sylvester equation by the proposed method.Finally,some numerical examples are given and numerical results are shown to demonstrate the accuracy and reliability of the above-mentioned algorithm.     

一类分数阶多项延迟微分方程的Jacobi谱配置方法

本文利用Jacobi谱配置方法数值求解了一类分数阶多项延迟微分方程,并证明了该方法是收敛的,通过若干数值算例验证了相应的理论结果,结果表明Jacobi谱配置方法求解这类方程是非常高效的,同时也为这类分数阶延迟微分方程的数值求解提供了新的选择,对分数阶泛函方程的数值方法的研究有一定的指导意义.     

DISCRETE GALERKIN METHOD FOR FRACTIONAL INTEGRO-DIFFERENTIAL EQUATIONS

In this article, we develop a fully Discrete Galerkin(DG) method for solving initial value fractional integro-differential equations(FIDEs). We consider Generalized Jacobi polynomials(GJPs) with indexes corresponding to the number of homogeneous initial conditions as natural basis functions for the approximate solution. The fractional derivatives are used in the Caputo sense. The numerical solvability of algebraic system obtained from implementation of proposed method for a special case of FIDEs is investigated. We also provide a suitable convergence analysis to approximate solutions under a more general regularity assumption on the exact solution. Numerical results are presented to demonstrate the effectiveness of the proposed method.     

On modified Jacobi linear operators

By means of successive partial substitutions, new fixed point linear equations can be obtained from old ones. The Jacobi method applied to a system in the sequence thus obtained constitutes a partial Gauss-Seidel method applied to the original one, and we analyze the behavior of the sequence of spectral radii of the successive iteration matrices (the modified Jacobi operators); we do this under the assumption that the starting operator is nonnegative with respect to a proper cone and has spectral radius less (or greater) than 1. Our main result is that, if the Jacobi operator obtained after k substitutions is irreducible, then the following one either is the same or has strictly smaller (or greater) spectral radius. This result implies that the whole sequence of spectral radii is monotone.     

The alternative Legendre Tau method for solving nonlinear multi-order fractional differential equations

In this paper, the alternative Legendre polynomials (ALPs) are used to approximate the solution of a class of nonlinear multi-order fractional differential equations (FDEs). First, the operational matrix of fractional integration of an arbitrary order and the product operational matrix are derived for ALPs. These matrices together with the spectral Tau method are then utilized to reduce the solution of the mentioned equations into the one of solving a system of nonlinear algebraic equations with unknown ALP coefficients of the exact solution. The fractional derivatives are considered in the Caputo sense and the fractional integration is described in the Riemann-Liouville sense. Numerical examples illustrate that the present method is very effective for linear and nonlinear multi-order FDEs and high accuracy solutions can be obtained only using a small number of ALPs.     

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations: Application to Orthogonal Polynomials

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite–Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite–Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.     

A new numerical algorithm to solve fractional differential equations based on operational matrix of generalized hat functions

In this paper, we propose a new numerical algorithm for solving linear and non linear fractional differential equations based on our newly constructed integer order and fractional order generalized hat functions operational matrices of integration. The linear and nonlinear fractional order differential equations are transformed into a system of algebraic equations by these matrices and these algebraic equations are solved through known computational methods. Further some numerical examples are given to illustrate and establish the accuracy and reliability of the proposed algorithm. The results obtained, using the scheme presented here, are in full agreement with the analytical solutions and numerical results presented elsewhere.     

A new numerical method for delay and advanced integro-differential equations

A general formulation is constructed for Jacobi operational matrices of integration, product, and delay on an arbitrary interval. The main purpose of this study is to improve Jacobi operational matrices for solving delay or advanced integro–differential equations. Some theorems are established and utilized to reduce the computational costs. All algorithms can be used for both linear and nonlinear Fredholm and Volterra integro-differential equations with delay. An error estimator is introduced to approximate the absolute error when the exact solution of a given problem is not available. The error of the proposed method is less compared to other common methods such as the Taylor collocation, Chebyshev collocation, hybrid Euler–Taylor matrix, and Boubaker collocation methods. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments.     

Fractional-order Legendre functions for solving fractional-order differential equations

In this article, a general formulation for the fractional-order Legendre functions (FLFs) is constructed to obtain the solution of the fractional-order differential equations. Fractional calculus has been used to model physical and engineering processes that are found to be best described by fractional differential equations. Therefore, an efficient and reliable technique for the solution of them is too important. For the concept of fractional derivative we will adopt Caputo’s definition by using Riemann–Liouville fractional integral operator. Our main aim is to generalize the new orthogonal functions based on Legendre polynomials to the fractional calculus. Also a general formulation for FLFs fractional derivatives and product operational matrices is driven. These matrices together with the Tau method are then utilized to reduce the solution of this problem to the solution of a system of algebraic equations. The method is applied to solve linear and nonlinear fractional differential equations. Illustrative examples are included to demonstrate the validity and applicability of the presented technique.     

A novel method for nonlinear fractional partial differential equations: Combination of DTM and generalized Taylor's formula

In this article, a novel numerical method is proposed for nonlinear partial differential equations with space- and time-fractional derivatives. This method is based on the two-dimensional differential transform method (DTM) and generalized Taylor's formula. The fractional derivatives are considered in the Caputo sense. Several illustrative examples are given to demonstrate the effectiveness of the present method. Results obtained using the scheme presented here agree well with the analytical solutions and the numerical results presented elsewhere. Results also show that the numerical scheme is very effective and convenient for solving nonlinear partial differential equations of fractional order.