Three-point methods with and without memory for solving nonlinear equations

From MaRDI portal

Publication:426501

Jump to:navigation, search

DOI10.1016/j.amc.2011.10.057zbMath1248.65049OpenAlexW2035281777MaRDI QIDQ426501

Miodrag S. Petković, Jovana Džunić, Ljiljana D. Petković

Publication date: 11 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.10.057

zbMATH Keywords

numerical examples nonlinear equations computational efficiency acceleration of convergence R-order of convergence multipoint methods secant-type method Kung-Traub conjecture derivative free method methods with memory Newton's interpolatory polynomial three-point method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Related Items (71)

On modified two-step iterative method in the fractional sense: some applications in real world phenomena ⋮ A general family of third order method for finding multiple roots ⋮ Derivative free iterative methods with memory having higher R-order of convergence ⋮ An analysis of a new family of eighth-order optimal methods ⋮ Highly efficient family of iterative methods for solving nonlinear models ⋮ Solving nonlinear equations by a derivative-free form of the King's family with memory ⋮ A new family of iterative methods widening areas of convergence ⋮ An analysis of a family of Maheshwari-based optimal eighth order methods ⋮ An efficient class of multipoint root-solvers with and without memory for nonlinear equations ⋮ On developing a higher-order family of double-Newton methods with a bivariate weighting function ⋮ On efficient two-parameter methods for solving nonlinear equations ⋮ Design and Analysis of a New Class of Derivative-Free Optimal Order Methods for Nonlinear Equations ⋮ Basins of attraction for optimal eighth order methods to find simple roots of nonlinear equations ⋮ A note on the convergence rate of Kumar-Singh-Srivastava methods for solving nonlinear equations ⋮ An optimal and efficient general eighth-order derivative free scheme for simple roots ⋮ A new accelerating technique applied to a variant of Cordero-Torregrosa method ⋮ An Ostrowski-type method with memory using a novel self-accelerating parameter ⋮ A new family of adaptive methods with memory for solving nonlinear equations ⋮ How good are methods with memory for the solution of nonlinear equations? ⋮ An efficient optimal family of sixteenth order methods for nonlinear models ⋮ Dynamics of iterative families with memory based on weight functions procedure ⋮ An optimal reconstruction of Chebyshev-Halley type methods for nonlinear equations having multiple zeros ⋮ On generalized multipoint root-solvers with memory ⋮ A new class of derivative-free root solvers with increasing optimal convergence order and their complex dynamics ⋮ Iterative volume-of-fluid interface positioning in general polyhedrons with consecutive cubic spline interpolation ⋮ A new optimal eighth-order family of iterative methods for the solution of nonlinear equations ⋮ On the construction of some tri-parametric iterative methods with memory ⋮ A note on the modified super-Halley method ⋮ Three new optimal fourth-order iterative methods to solve nonlinear equations ⋮ Optimal fourth and eighth-order iterative methods for non-linear equations ⋮ On a family of high-order iterative methods under Kantorovich conditions and some applications ⋮ Algorithm for forming derivative-free optimal methods ⋮ Some modifications of Newton's method for solving systems of equations ⋮ Some efficient derivative free methods with memory for solving nonlinear equations ⋮ Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices ⋮ Two bi-accelerator improved with memory schemes for solving nonlinear equations ⋮ Contrasts in the basins of attraction of structurally identical iterative root finding methods ⋮ A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations ⋮ A biparametric extension of King's fourth-order methods and their dynamics ⋮ Derivative free iterative methods with memory of arbitrary high convergence order ⋮ A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points ⋮ Some novel optimal eighth order derivative-free root solvers and their basins of attraction ⋮ Stable high-order iterative methods for solving nonlinear models ⋮ A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics ⋮ Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations ⋮ On the dynamics of a triparametric family of optimal fourth-order multiple-zero finders with a weight function of the principal \(m\)th root of a function-to-function ratio ⋮ Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations ⋮ Some novel and optimal families of King's method with eighth and sixteenth-order of convergence ⋮ Stability of King's family of iterative methods with memory ⋮ An optimal family of eighth-order simple-root finders with weight functions dependent on function-to-function ratios and their dynamics underlying extraneous fixed points ⋮ Constructing a family of optimal eighth-order modified Newton-type multiple-zero finders along with the dynamics behind their purely imaginary extraneous fixed points ⋮ On the approximation of \(m\)th power divided differences preserving the local order of convergence ⋮ On some iterative methods with memory and high efficiency index for solving nonlinear equations ⋮ On an efficient family of derivative free three-point methods for solving nonlinear equations ⋮ On generalized biparametric multipoint root finding methods with memory ⋮ Developing high order methods for the solution of systems of nonlinear equations ⋮ Convergence and dynamics of structurally identical root finding methods ⋮ A new family of Newton-type iterative methods with and without memory for solving nonlinear equations ⋮ A cubically convergent Steffensen-like method for solving nonlinear equations ⋮ On new computational local orders of convergence ⋮ On a two-step relaxed Newton-type method ⋮ HIGHER-ORDER FAMILIES OF MULTIPLE ROOT FINDING METHODS SUITABLE FOR NON-CONVERGENT CASES AND THEIR DYNAMICS ⋮ Efficient Family of Sixth-Order Methods for Nonlinear Models with Its Dynamics ⋮ Efficient \(n\)-point iterative methods with memory for solving nonlinear equations ⋮ An efficient high order iterative scheme for large nonlinear systems with dynamics ⋮ CMMSE: a novel scheme having seventh-order convergence for nonlinear systems ⋮ A triparametric family of optimal fourth-order multiple-root finders and their dynamics ⋮ Unnamed Item ⋮ Some higher-order iteration functions for solving nonlinear models ⋮ The polynomial pivots as initial values for a new root-finding iterative method ⋮ An optimal eighth-order class of three-step weighted Newton's methods and their dynamics behind the purely imaginary extraneous fixed points

Cites Work

This page was built for publication: Three-point methods with and without memory for solving nonlinear equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:426501&oldid=12301354"