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 nodes is used the resulting iterative method has convergence order at least , starting with the case (which corresponds to the Newton's method).
Recommendations
- Iterative functions with order of convergence greater than that of Newton's method
- A family of iterative methods with higher-order convergence
- Some variant of Newton's method with third-order convergence.
- High order quadrature based iterative method for approximating the solution of nonlinear equations
- Quadrature based two-step iterative methods for non-linear equations
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A method for solving nonlinear equations
- A variant of Newton's method with accelerated third-order convergence
- scientific article; zbMATH DE number 46780 (Why is no real title available?)
- scientific article; zbMATH DE number 1009690 (Why is no real title available?)
- scientific article; zbMATH DE number 1061412 (Why is no real title available?)
- scientific article; zbMATH DE number 1148205 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 5488709 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- New higher order derivative-free methods for solving nonlinear equations
- Numerical Methods in Scientific Computing, Volume I
- Quadrature based three-step iterative method for non-linear equations
- Quadrature theory. The theory of numerical integration on a compact interval
- Removing multiplicities in \(\mathbb C\) by double Newtonization
- Third-order methods from quadrature formulae for solving systems of nonlinear equations.
Cited in
(14)- Effective high-order iterative methods via the asymptotic form of the Taylor-Lagrange remainder
- Newton's method and high-order algorithms for the \(n\)th root computation
- Quadrature based optimal iterative methods with applications in high-precision computing
- A generalized family of quadrature based iterative methods
- Convergence of a class of efficient quadrature-based predictor-corrector methods for root-finding
- The Catalan numbers in the approximation of roots of quadratic polynomials
- scientific article; zbMATH DE number 3945258 (Why is no real title available?)
- On extensions of the Newton-Raphson iterative scheme to arbitrary orders
- A fourth order method for finding a simple root of univariate function
- scientific article; zbMATH DE number 6129896 (Why is no real title available?)
- Iterative functions with order of convergence greater than that of Newton's method
- New family of root-finding algorithms based on inverse rational interpolation
- A family of iterative methods with higher-order convergence
- High order iterative schemes for quadratic equations
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)