Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations
From MaRDI portal
Publication:638098
DOI10.1155/2011/972537zbMATH Open1220.65069OpenAlexW2058835721WikidataQ58688006 ScholiaQ58688006MaRDI QIDQ638098FDOQ638098
Authors: Sanjeev Kumar, V. Kanwar, S. K. Tomar, Sukhjit Singh 
Publication date: 9 September 2011
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/972537
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations
- Newton's method and its use in optimization
- Modified families of Newton, Halley and Chebyshev methods
- On a class of quadratically convergent iteration formulae
- Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations
- On new exponential quadratically convergent iterative formulae
- A class of exponential quadratically convergent iterative formulae for unconstrained optimization
Cited In (9)
- 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
- Title not available (Why is that?)
- 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
- New highly efficient families of higher-order methods for simple roots, permitting \(f'(x_n)=0\)
Uses Software
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)
