In this paper, we use the repeated corrected Simpson's 3/8 quadrature method for obtaining the numerical solutions of Fredholm linear integral equations of the second kind. This method is more accurately than the repeated corrected Trapezoidal method and the repeated Simpson's 3/8 method. To illustrate the accuracy of this method, we give a numerical example

0

The method of solving volterra integral equation by using numerical solution is a simple operation but to require many memory space to compute and save the operation. The importance of this equation appeares new direction to solve the equation by using new methods to avoid obstacles. One of these methods employ neural network for obtaining the solution.

This paper presents a proposed method by using cascade-forward neural network to simulate volterra integral equations solutions. This method depends on training cascade-forward neural network by inputs which represent the mean of volterra integral equations solutions, the target of cascade-forward neural network is to get the desired output of this network. Cascade-forward neural

A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple techniqu

Volterra – Fredholm integral equations (VFIEs) have a massive interest from researchers recently. The current study suggests a collocation method for the mixed Volterra - Fredholm integral equations (MVFIEs)."A point interpolation collocation method is considered by combining the radial and polynomial basis functions using collocation points". The main purpose of the radial and polynomial basis functions is to overcome the singularity that could associate with the collocation methods. The obtained interpolation function passes through all Scattered Point in a domain and therefore, the Delta function property is the shape of the functions. The exact solution of selective solutions was compared with the results obtained

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

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 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.   

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

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro