In this paper, the linear system of Fredholm integral equations is solving using Open Newton-Cotes formula, which we use five different types of Open Newton-Cotes formula to solve this system.  Compare the results of suggested method with the results of another method (closed Newton-Cotes formula)    Finally, at the end of each method, algorithms and programs developed and written in MATLAB (version 7.0) and we give some numerical examples, illustrate suggested method

     In this paper, the Adomian decomposition method (ADM) is successfully applied to find the approximate solutions for the system of fuzzy Fredholm integral equations (SFFIEs) and we also study the convergence of the technique. A consistent way to reduce the size of the computation is given to reach the exact solution. One of the best methods adopted to determine the behavior of the approximate solutions. Finally, the problems that have been addressed confirm the validity of the method  applied in this research using a comparison by combining numerical methods such as the Trapezoidal rule and Simpson rule with ADM.

0

In this paper, the series solution is applied to solve third order fuzzy differential equations with a fuzzy initial value. The proposed method applies Taylor expansion in solving the system and the approximate solution of the problem which is calculated in the form of a rapid convergent series; some definitions and theorems are reviewed as a basis in solving fuzzy differential equations. An example is applied to illustrate the proposed technical accuracy. Also, a comparison between the obtained results is made, in addition to the application of the crisp solution, when the-level equals one.

In this paper, the Decomposition method was used to find approximation solutions for a system of linear Fredholm integral equations of the second kind. In this method the solution of a functional equations is considered as the sum of an infinite series usually converging to the solution, and Adomian decomposition method for solving linear and nonlinear integral equations. Finally, numerical examples are prepared to illustrate these considerations.

  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

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

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.