The aim of this paper is to employ the fractional shifted Legendre polynomials (FSLPs) in the matrix form to approximate the fractional derivatives and find the numerical solutions of the one-dimensional space-fractional bioheat equation (SFBHE). The Caputo formula was utilized to approximate the fractional derivative. The proposed methodology applied for two examples showed its usefulness and efficiency. The numerical results showed that the utilized technique is very efficacious with high accuracy and good convergence.

     In this paper, we introduce an approximate method for solving fractional order delay variational problems using fractional Euler polynomials operational matrices. For this purpose, the operational matrices of fractional integrals and derivatives are designed for Euler polynomials. Furthermore, the delay term in the considered functional is also decomposed in terms of the operational matrix of the fractional Euler polynomials. It is applied and substituted together with the other matrices of the fractional integral and derivative into the suggested functional. The main equations are then reduced to a system of algebraic equations. Therefore, the desired solution to the original variational problem is obtained by solving the resul

This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.

In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.

This work describes two efficient and useful methods for solving fractional pantograph delay equations (FPDEs) with initial and boundary conditions. These two methods depend mainly on orthogonal polynomials, which are the method of the operational matrix of fractional derivative that depends on Bernstein polynomials and the operational matrix of the fractional derivative with Shifted Legendre polynomials. The basic procedure of this method is to convert the pantograph delay equation to a system of linear equations and by using, the operational matrices we get rid of the integration and differentiation operations, which makes solving the problem easier. The concept of Caputo has been used to describe fractional derivatives. Finally, some

In this paper, we present an approximate method for solving integro-differential equations of multi-fractional order by using the variational iteration method.
First, we derive the variational iteration formula related to the considered problem, then prove its convergence to the exact solution. Also we give some illustrative examples of linear and nonlinear equations.

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.