in this paper, we use the parametric form of fuzzy numbers, and aniterative approach for obtaining approximate solution for a classof fuzzy nonlinear fredholm integral equations of the second kindis proposed. this paper presents a method based on newton-cotesmethods with positive coefficient. then we obtain approximatesolution of the fuzzy nonlinear integral equations by an iterativeapproach.

Abstract. It was shown by P. J. Davis that the Newton-Cotes quadrature formula is convergent if the integrand is an analytic function that is regular in a sufficiently large region of the complex plane containing the interval of integration. In the present paper, a bound on the error of the Newton-Cotes quadrature formula for analytic functions is derived. Also the bounds on the Legendre polyno...

fuzzy newton-cotes method for integration of fuzzy functions that was proposed by ahmady in [1]. in this paper we construct error estimate of fuzzy newton-cotes method such as fuzzy trapezoidal rule and fuzzy simpson rule by using taylor's series. the corresponding error terms are proven by two theorems. we prove that the fuzzy trapezoidal rule is accurate for fuzzy polynomial of degree one and...

In this paper, a set of Root mean square derivative based closed Newton Cotes quadrature formula (RMSDCNC) is introduced in which the derivative value is included in addition to the existing closed Newton Cotes quadrature (CNC) formula for the calculation of a definite integral in the inetrval [a, b]. These derivative value is measured by using the root mean square value. The proposed formula y...

We prove that to every rational function R(z) satisfying R(−z)R(z) = 1, there exists a symplectic Runge-Kutta method with R(z) as stability function. Moreover, we give a surprising relation between the poles of R(z) and the weights of the quadrature formula associated with a symplectic Runge-Kutta method.

We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with n+ 1 nodes is used the resulting iterative method has convergence order at least n+ 2, starting with the case n = 0 (which corresponds to the Newton’s method).

A function and its first two derivatives are estimated by convolutions with well-chosen non-differentiable kernels. The convolutions are in turn approximated by Newton–Cotes integration techniques with the aid of a polynomial interpolation based on an arbitrary finite set of points. Precise numerical results are obtained with far fewer points than that in classic SPH, and error bounds are deriv...

In this paper a higher-order numerical solution of a non-linear Volterra integro-differential equation is discussed. Example of this question has been solved numerically using the Runge-Kutta-Verner method for Ordinary Differential Equation (ODE) part and Newton-Cotes formulas for integral parts.