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.

hybrid of rationalized haar functions are developed to approximate the solution of the differential equations. the properties of hybrid functions which are the combinations of block-pulse functions and rationalized haar functions are first presented. these properties together with the newton-cotes nodes are then utilized to reduce the differential equations to the solution of algebraic equation...

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

The purpose of this paper is to reduce the complexity computing components integral Fm-transform, m≥0, whose analytic expressions include definite integrals. We propose use nontrivial quadrature rules with nonuniformly distributed integration points instead widely used Newton–Cotes formulas. As weight function that determines orthogonality, we choose generating fuzzy partition associated Fm-tra...

the spline collocation method  is employed to solve a system of linear and nonlinear fredholm and volterra integro-differential equations. the solutions are collocated by cubic b-spline and the integrand is approximated by the newton-cotes formula. we obtain the unique solution for linear and nonlinear system $(nn+3n)times(nn+3n)$ of integro-differential equations. this approximation reduces th...

The solution of an integral equation arising in a covariance factorization problem is obtained by a Newton-Raphson iteration that is almost always globally convergent. Interpretations of the iterates are given, and the result is shown to specialize to known algorithms when the covariance is stationary with a rational Fourier transform.

The main purpose of this paper is to find fuzzy root of fuzzy polynomials (if exists) by using Newton-Raphson method. The proposed numerical method has capability to solve fuzzy polynomials as well as algebric ones. For this purpose, by using parametric form of fuzzy coefficients of fuzzy polynomial and Newton-Rphson method we can find its fuzzy roots. Finally, we illustrate our approach by nu...

The solution to the problem of factorization of the covariance function of a stationary, discrete-time process is obtained by using a Newton-Raphson procedure which converges quadratically in I1 provided the initial iterate is chosen suitably. The existence of a suitable initial iterate is guaranteed by an approximation result. An application to error localization in spectral factorization is s...

Szegö quadrature formulas represent the analogue on the unit circle of the well-known Gauss–Christoffel quadratures for intervals of the real line. In the present work, Szegö formulas are revised and an application to the computation of the Fourier transform given. 2006 Elsevier Inc. All rights reserved.