On zero finding methods of higher order from data at one point
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- On the efficiency of algorithms of analysis
- The fundamental theorem of algebra and complexity theory
Cited in
(12)- Approximate Zeros of Quadratically Convergent Algorithms
- Unified complexity analysis for Newton LP methods
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- The guaranteed convergence of Laguerre-like method
- The convergence of a family of parallel zero-finding methods
- On the convergence of Wang-Zheng's method
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Point estimation of a family of simultaneous zero-finding methods
- On the guaranteed convergence of the square-root iteration method
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
- A new fourth-order family of simultaneous methods for finding polynomial zeros
This page was built for publication: On zero finding methods of higher order from data at one point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122311)
