Rationalized Haar functions are developed to approximate the solution of the nonlinear Volterra–Fredholm–Hammerstein integral equations. The properties of rationalized Haar functions are first presented. These properties together with the Newton–Cotes nodes and Newton–Cotes integration method are then utilized to reduce the solution of Volterra–Fredholm–Hammerstein integral equations to the sol...

In this paper, we investigate the connection between closed Newton-Cotes formulae, trigonometrically-fitted methods, symplectic integrators and efficient integration of the Schr¨odinger equation. The study of multistep symplectic integrators is very poor although in the last decades several one step symplectic integrators have been produced based on symplectic geometry (see the relevant lit...

The aim of this work, is to evaluate the value of a fuzzy integral by applying the Newton-Cotes integration rules via a reliable scheme. In order to perform the numerical examples, the CADNA (Control of Accuracy and Debugging for Numerical Applications) library and the CESTAC (Controle et Estimation Stochastique des Arrondis de Calculs) method are applied based on the stochastic arithmetic. By ...

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.

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

Abs t r ac t -An account is given of the role played by moments and modified moments in the construction of quadrature rules, specifically weighted Newton-Cotes and Gaussian rules. Fast and slow Lagrange interpolation algorithms, combined with Gaussian quadrature, as well as linear algebra methods based on moment equations, axe described for generating Newton-Cotes formulae. The weaknesses and ...

In this paper, the computation of numerical integration using arithmetic mean (AMDCNC), geometric mean (GMDCNC) and harmonic mean (HMDCNC) derivativebased closed Newton cotes quadrature rules are compared with the existing closed Newton cotes quadrature rule (CNC). The comparison shows that, arithmetic mean-based rule gives better solution than the other two rules. This set of quadrature rules ...

Our paper reviews Kallay’s results on a geometric version of the classic Newton-Raphson method, in the context of plane curve queries, e.g. curve-curve intersection, point-curve distance computation. Variants of the geometric Newton-Raphson methods are proposed and empirically verified.

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

The use of computer algebra systems in a course on scientific computation is demonstrated. Various examples, such as the derivation of Newton’s iteration formula, the secant method, Newton–Cotes and Gaussian integration formulas, as well as Runge–Kutta formulas, are presented. For the derivations, the computer algebra system Maple is used.