Iteration functions re-visited
DOI10.1016/J.CAM.2016.08.021zbMATH Open1357.30003OpenAlexW2507855220MaRDI QIDQ730575FDOQ730575
Authors: Michael Farmer, George Loizou, Stephen Maybank 
Publication date: 28 December 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.08.021
Recommendations
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)
Cites Work
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Title not available (Why is that?)
- A modified Newton method for polynomials
- A family of root finding methods
- Iterative methods for simultaneous inclusion of polynomial zeros
- Title not available (Why is that?)
- Title not available (Why is that?)
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- An algorithm for the total, or partial, factorization of a polynomial
- Title not available (Why is that?)
- Hansen-Patrick's family is of Laguerre's type
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- A family of root-finding methods with accelerated convergence
- Locating multiple zeros interactively
- Orders of Convergence for Iterative Procedures
- On the Penultimate Remainder Algorithm and the Catalytic Multiplier
- Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
Cited In (9)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- Title not available (Why is that?)
- Computational geometry as a tool for studying root-finding methods
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Iterating the Derived Set Function
- Efficient computation of the iteration of functions
- Title not available (Why is that?)
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
Uses Software
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)
