In this work, we employ a new normalization Bernstein basis for solving linear Freadholm of fractional integro-differential equations  nonhomogeneous  of the second type (LFFIDE_s). We adopt Petrov-Galerkian method (PGM) to approximate solution of the (LFFIDE_s) via normalization Bernstein basis that yields linear system. Some examples are given and their results are shown in tables and figures, the Petrov-Galerkian method (PGM) is very effective and convenient and overcome the difficulty of traditional methods. We solve this problem (LFFIDE_s) by the assistance of Matlab10.   

     Fractional calculus has paid much attention in recent years, because it plays an essential role in many fields of science and  engineering, where the study of stability theory of fractional differential equations emerges to be very important. In this paper, the stability of fractional order ordinary differential equations will be studied and introduced the backstepping method. The Lyapunov function  is easily found by this method. This method also gives a guarantee of stable solutions for the fractional order differential equations. Furthermore it gives asymptotically stable.

     The time fractional order differential equations are fundamental tools that are used for modeling neuronal dynamics. These equations are obtained by substituting the time derivative of order  where , in the standard equation with the Caputo fractional formula. In this paper, two implicit difference schemes: the linearly Euler implicit and the Crank-Nicolson (CN) finite difference schemes, are employed in solving a one-dimensional time-fractional semilinear equation with Dirichlet boundary conditions. Moreover, the consistency, stability and convergence of the proposed schemes are investigated. We prove that the IEM is unconditionally stable, while CNM is conditionally stable. Furthermore, a comparative study between these two s

The goal of this paper is to expose a new numerical method for solving initial value time-lag of delay differential equations by employing a high order improving formula of Euler method known as third order Euler method. Stability condition is discussed in detail for the proposed technique. Finally some examples are illustrated to verify the validity, efficiency and accuracy of the method.

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

     This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

 In this paper, we study the convergence theorems of the Modified Ishikawa iterative sequence with mixed errors for the uniformly continuous mappings and solving nonlinear uniformly continuous mappings equation in arbitrary real Banach space.

     This article aims to determine the time-dependent heat coefficient together with the temperature solution for a type of semi-linear time-fractional inverse source problem by applying a method based on the finite difference scheme and Tikhonov regularization. An unconditionally stable implicit finite difference scheme is used as a direct (forward) solver. While by the MATLAB routine lsqnonlin from the optimization toolbox, the inverse problem is reformulated as nonlinear least square minimization and solved efficiently. Since the problem is generally incorrect or ill-posed that means any error inclusion in the input data will produce a large error in the output data. Therefore, the Tikhonov regularization technique is applie