Root finding by high order iterative methods based on quadratures

From MaRDI portal
Publication:1659672



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






Describes a project that uses

Uses Software






This page was built for publication: Root finding by high order iterative methods based on quadratures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659672)