Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations
From MaRDI portal
Publication:638098
Recommendations
- Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations
- A weighted variant family of Newton's method with accelerated third-order convergence
- A family of methods for solving nonlinear equations
- Efficient families of Newton's method and its variants suitable for non-convergent cases
- Modified families of Newton, Halley and Chebyshev methods
Cites work
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A class of exponential quadratically convergent iterative formulae for unconstrained optimization
- Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations
- Modified families of Newton, Halley and Chebyshev methods
- Newton's method and its use in optimization
- On a class of quadratically convergent iteration formulae
- On new exponential quadratically convergent iterative formulae
- Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations
Cited in
(10)- New highly efficient families of higher-order methods for simple roots, permitting \(f'(x_n)=0\)
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Dynamical techniques for analyzing iterative schemes with memory
- An efficient two-point iterative method with memory for solving non-linear equations and its dynamics
- Several two-point with memory iterative methods for solving nonlinear equations
- scientific article; zbMATH DE number 5049616 (Why is no real title available?)
- Family of multipoint with memory iterative schemes for solving nonlinear equations
- Efficient families of Newton's method and its variants suitable for non-convergent cases
- Optimized Steffensen-type methods with eighth-order convergence and high efficiency index
- On some modified families of multipoint iterative methods for multiple roots of nonlinear equations
This page was built for publication: Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638098)
