Multipoint iterative methods for finding all the simple zeros in an interval

DOI10.1155/2014/601205zbMath1442.65090OpenAlexW2086962715WikidataQ59053718 ScholiaQ59053718MaRDI QIDQ2336572

Yanyan Li

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/601205

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (6)

Polynomiography based on the nonstandard Newton-like root finding methods ⋮ A new class of Halley's method with third-order convergence for solving nonlinear equations ⋮ A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations ⋮ Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations ⋮ Efficient iterative methods with and without memory possessing high efficiency indices ⋮ An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative methods for solving nonlinear equations with finitely many roots in an interval
• Interval Ostrowski-type methods with guaranteed convergence
• Newton's method's basins of attraction revisited
• A multi-parameter family of three-step eighth-order iterative methods locating a simple root
• Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse
• A matrix iteration for finding Drazin inverse with ninth-order convergence
• An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign
• A new family of Newton-type iterative methods with and without memory for solving nonlinear equations
• A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function
• A three-step iterative method for non-linear systems with sixth order of convergence
• Mathematica®: A Problem-Centered Approach
• Mathematica in Action
• Optimal Order of One-Point and Multipoint Iteration
• A family of fast derivative-free fourth-order multipoint optimal methods for nonlinear equations
• On Some Multipoint Methods Arrising from Optimal in the Sense of Kung-Traub Algorithms for Numerical Solution of Nonlinear Equations

This page was built for publication: Multipoint iterative methods for finding all the simple zeros in an interval