Iteration functions re-visited
From MaRDI portal
A straightforward mechanism for deriving one-point iteration functions (IFs) of order two or more, or simultaneous IFs of order three or more, is given. In addition, the case of multiple zeros is explored. These IFs are extensively tested computationally, and experimental results are given.
Recommendations
Cites work
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- A family of root finding methods
- A family of root-finding methods with accelerated convergence
- A modified Newton method for polynomials
- An algorithm for the total, or partial, factorization of a polynomial
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Hansen-Patrick's family is of Laguerre's type
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3260031 (Why is no real title available?)
- scientific article; zbMATH DE number 3313124 (Why is no real title available?)
- Iterative methods for simultaneous inclusion of polynomial zeros
- Locating multiple zeros interactively
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- On the Penultimate Remainder Algorithm and the Catalytic Multiplier
- Orders of Convergence for Iterative Procedures
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
Cited in
(10)- Efficient computation of the iteration of functions
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- Iterating the Derived Set Function
- scientific article; zbMATH DE number 3878247 (Why is no real title available?)
- scientific article; zbMATH DE number 800197 (Why is no real title available?)
- Computational geometry as a tool for studying root-finding methods
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- On the algebraic complexity of rational iteration procedures
This page was built for publication: Iteration functions re-visited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730575)