A new approach by two‐dimensional wavelets operational matrix method for solving variable‐order fractional partial integro‐differential equations

In this paper, a new computational scheme based on operational matrices (OMs) of two‐dimensional wavelets is proposed for the solution of variable‐order (VO) fractional partial integro‐differential equations (PIDEs). To accomplish this method, first OMs of integration and VO fractional derivative (FD) have been derived using two‐dimensional Legendre wavelets. By implementing two‐dimensional wavelets approximations and the OMs of integration and variable‐order fractional derivative (VO‐FD) along with collocation points, the VO fractional partial PIDEs are reduced into the system of algebraic equations. In addition to this, some useful theorems are discussed to establish the convergence analysis and error estimate of the proposed numerical technique. Furthermore, computational efficiency and applicability are examined through some illustrative examples.     

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 numerical technique for solving fractional variational problems

This paper presents an accurate numerical method for solving a class of fractional variational problems (FVPs). The fractional derivative in these problems is in the Caputo sense. The proposed method is called fractional Chebyshev finite difference method. In this technique, we approximate FVPs and end up with a finite‐dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. The fractional derivative approximation using Clenshaw and Curtis formula introduced here, along with Clenshaw and Curtis procedure for the numerical integration of a non‐singular functions and the Rayleigh–Ritz method for the constrained extremum, is considered. By this method, the given problem is reduced to the problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FVPs. Special attention is given to study the convergence analysis and evaluate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique. A comparison with another method is given. Copyright © 2012 John Wiley & Sons, Ltd.     

A New Approach for Solving a Class of Delay Fractional Partial Differential Equations

In this article, a new numerical approach has been proposed for solving a class of delay time-fractional partial differential equations. The approximate solutions of these equations are considered as linear combinations of Müntz–Legendre polynomials with unknown coefficients. Operational matrix of fractional differentiation is provided to accelerate computations of the proposed method. Using Padé approximation and two-sided Laplace transformations, the mentioned delay fractional partial differential equations will be transformed to a sequence of fractional partial differential equations without delay. The localization process is based on the space-time collocation in some appropriate points to reduce the fractional partial differential equations into the associated system of algebraic equations which can be solved by some robust iterative solvers. Some numerical examples are also given to confirm the accuracy of the presented numerical scheme. Our results approved decisive preference of the Müntz–Legendre polynomials with respect to the Legendre polynomials.     

Numerical technique based on generalized Laguerre and shifted Chebyshev polynomials

In this study, we present a numerical scheme for solving a class of fractional partial differential equations. First, we introduce psi -Laguerre polynomials like psi-shifted Chebyshev polynomials and employ these newly introduced polynomials for the solution of space-time fractional differential equations. In our approach, we project these polynomials to develop operational matrices of fractional integration. The use of these orthogonal polynomials converts the problem under consideration into a system of algebraic equations. The solution of this system provide us the desired results. The convergence of the proposed method is analyzed. Finally, some illustrative examples are included to observe the validity and applicability of the proposed method.     

Application of the modified operational matrices in multiterm variable‐order time‐fractional partial differential equations

In this paper, we present a novel discrete scheme based on Genocchi polynomials and fractional Laguerre functions to solve multiterm variable‐order time‐fractional partial differential equations (M‐V‐TFPDEs) in the large interval. In this purpose, the accurate modified operational matrices are constructed to reduce the problems into a system of algebraic equations. Also, the computational algorithm based on the method and modified operational matrices in the large interval is easily implemented. Furthermore, we discuss the error estimation of the proposed method. Ultimately, to confirm our theoretical analysis and accuracy of numerical approach, several examples are presented.     

Solution of nonlinear weakly singular Volterra integral equations using the fractional‐order Legendre functions and pseudospectral method

In this article, our main goal is to render an idea to convert a nonlinear weakly singular Volterra integral equation to a non‐singular one by new fractional‐order Legendre functions. The fractional‐order Legendre functions are generated by change of variable on well‐known shifted Legendre polynomials. We consider a general form of singular Volterra integral equation of the second kind. Then the fractional Legendre–Gauss–Lobatto quadratures formula eliminates the singularity of the kernel of the integral equation. Finally, the Legendre pseudospectral method reduces the solution of this problem to the solution of a system of algebraic equations. This method also can be utilized on fractional differential equations as well. The comparison of results of the presented method and other numerical solutions shows the efficiency and accuracy of this method. Also, the obtained maximum error between the results and exact solutions shows that using the present method leads to accurate results and fast convergence for solving nonlinear weakly singular Volterra integral equations. Copyright © 2015 John Wiley & Sons, Ltd.     

A numerical technique for solving a class of fractional variational problems

This paper presents a numerical method for solving a class of fractional variational problems (FVPs) with multiple dependent variables, multi order fractional derivatives and a group of boundary conditions. The fractional derivative in the problem is in the Caputo sense. In the presented method, the given optimization problem reduces to a system of algebraic equations using polynomial basis functions. An approximate solution for the FVP is achieved by solving the system. The choice of polynomial basis functions provides the method with such a flexibility that initial and boundary conditions can be easily imposed. We extensively discuss the convergence of the method and finally present illustrative examples to demonstrate validity and applicability of the new technique.     

Numerical solutions of distributed order fractional differential equations in the time domain using the Müntz–Legendre wavelets approach

In this paper, a numerical method is presented to obtain and analyze the behavior of numerical solutions of distributed order fractional differential equations of the general form in the time domain with the Caputo fractional derivative. The suggested method is based on the Müntz–Legendre wavelet approximation. We derive a new operational vector for the Riemann–Liouville fractional integral of the Müntz–Legendre wavelets by using the Laplace transform method. Applying this operational vector and collocation method in our approach, the problem can be reduced to a system of linear and nonlinear algebraic equations. The arising system can be solved by the Newton method. Discussion on the error bound and convergence analysis for the proposed method is presented. Finally, seven test problems are considered to compare our results with other well‐known methods used for solving these problems. The results in the tabulated tables highlighted that the proposed method is an efficient mathematical tool for analyzing distributed order fractional differential equations of the general form.     

Numerical solution of multiterm variable‐order fractional differential equations via shifted Legendre polynomials

In this paper, shifted Legendre polynomials will be used for constructing the numerical solution for a class of multiterm variable‐order fractional differential equations. In the proposed method, the shifted Legendre operational matrix of the fractional variable‐order derivatives will be investigated. The fundamental problem is reduced to an algebraic system of equations using the constructed matrix and the collocation technique, which can be solved numerically. The error estimate of the proposed method is investigated. Some numerical examples are presented to prove the applicability, generality, and accuracy of the suggested method.     

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.     

A numerical scheme based on Bernoulli wavelets and collocation method for solving fractional partial differential equations with Dirichlet boundary conditions

In this paper, an efficient and accurate numerical method is presented for solving two types of fractional partial differential equations. The fractional derivative is described in the Caputo sense. Our approach is based on Bernoulli wavelets collocation techniques together with the fractional integral operator, described in the Riemann‐Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations, which greatly simplifies the problem. By using Newton's iterative method, this system is solved and the solution of fractional partial differential equations is achieved. Some results concerning the error analysis are obtained. The validity and applicability of the method are demonstrated by solving four numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions much easier.     

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.     

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.     

Numerical Solution of the Two-Sided Space–Time Fractional Telegraph Equation Via Chebyshev Tau Approximation

The operational matrices of left Caputo fractional derivative, right Caputo fractional derivative, and Riemann–Liouville fractional integral, for shifted Chebyshev polynomials, are presented and derived. We propose an accurate and efficient spectral algorithm for the numerical solution of the two-sided space–time Caputo fractional-order telegraph equation with three types of non-homogeneous boundary conditions, namely, Dirichlet, Robin, and non-local conditions. The proposed algorithm is based on shifted Chebyshev tau technique combined with the derived shifted Chebyshev operational matrices. We focus primarily on implementing the novel algorithm both in temporal and spatial discretizations. This algorithm reduces the problem to a system of algebraic equations greatly simplifying the problem. This system can be solved by any standard iteration method. For confirming the efficiency and accuracy of the proposed scheme, we introduce some numerical examples with their approximate solutions and compare our results with those achieved using other methods.     

Two‐dimensional shifted Legendre polynomial collocation method for electromagnetic waves in dielectric media via almost operational matrices

In this paper, a numerical solution of fractional partial differential equations (FPDEs) for electromagnetic waves in dielectric media will be discussed. For the solution of FPDEs, we developed a numerical collocation method using an algorithm based on two‐dimensional shifted Legendre polynomials approximation, which is proposed for electromagnetic waves in dielectric media. By implementing the partial Riemann–Liouville fractional derivative operators, two‐dimensional shifted Legendre polynomials approximation and its operational matrix along with collocation method are used to convert FPDEs first into weakly singular fractional partial integro‐differential equations and then converted weakly singular fractional partial integro‐differential equations into system of algebraic equation. Some results concerning the convergence analysis and error analysis are obtained. Illustrative examples are included to demonstrate the validity and applicability of the technique. Copyright © 2017 John Wiley & Sons, Ltd.     

Numerical method for solving diffusion-wave phenomena

We find solutions for the diffusion-wave problem in 1D with n-term time fractional derivatives whose orders belong to the intervals (0,1),(1,2) and (0,2) respectively, using the method of the approximation of the convolution by Laguerre polynomials in the space of tempered distributions. This method transfers the diffusion-wave problem into the corresponding infinite system of linear algebraic equations through the coefficients, which are uniquely solvable under some relations between the coefficients with index zero.The method is applicable for nonlinear problems too.     

High‐order numerical solution of second‐order one‐dimensional hyperbolic telegraph equation using a shifted Gegenbauer pseudospectral method

We present a high‐order shifted Gegenbauer pseudospectral method (SGPM) to solve numerically the second‐order one‐dimensional hyperbolic telegraph equation provided with some initial and Dirichlet boundary conditions. The framework of the numerical scheme involves the recast of the problem into its integral formulation followed by its discretization into a system of well‐conditioned linear algebraic equations. The integral operators are numerically approximated using some novel shifted Gegenbauer operational matrices of integration. We derive the error formula of the associated numerical quadratures. We also present a method to optimize the constructed operational matrix of integration by minimizing the associated quadrature error in some optimality sense. We study the error bounds and convergence of the optimal shifted Gegenbauer operational matrix of integration. Moreover, we construct the relation between the operational matrices of integration of the shifted Gegenbauer polynomials and standard Gegenbauer polynomials. We derive the global collocation matrix of the SGPM, and construct an efficient computational algorithm for the solution of the collocation equations. We present a study on the computational cost of the developed computational algorithm, and a rigorous convergence and error analysis of the introduced method. Four numerical test examples have been carried out to verify the effectiveness, the accuracy, and the exponential convergence of the method. The SGPM is a robust technique, which can be extended to solve a wide range of problems arising in numerous applications. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 307–349, 2016     

Convergence analysis for numerical solution of Fredholm integral equation by Sinc approximation

In this study one of the new techniques is used to solve numerical problems involving integral equations known as Sinc-collocation method. This method has been shown to be a powerful numerical tool for finding accurate solutions. So, in this article, some properties of the Sinc-collocation method required for our subsequent development are given and are utilized to reduce integral equation of the first kind to some algebraic equations. Then by a theorem we show error in the approximation of the solution decays at an exponential rate. Finally, numerical examples are included to demonstrate the validity and applicability of the technique.     

Fractional-Order Legendre Functions and Their Application to Solve Fractional Optimal Control of Systems Described by Integro-differential Equations

In this paper, we introduce a set of functions called fractional-order Legendre functions (FLFs) to obtain the numerical solution of optimal control problems subject to the linear and nonlinear fractional integro-differential equations. We consider the properties of these functions to construct the operational matrix of the fractional integration. Also, we achieved a general formulation for operational matrix of multiplication of these functions to solve the nonlinear problems for the first time. Then by using these matrices the mentioned fractional optimal control problem is reduced to a system of algebraic equations. In fact the functions of the problem are approximated by fractional-order Legendre functions with unknown coefficients in the constraint equations, performance index and conditions. Thus, a fractional optimal control problem converts to an optimization problem, which can then be solved numerically. The convergence of the method is discussed and finally, some numerical examples are presented to show the efficiency and accuracy of the method.