Point estimation of simultaneous methods for solving polynomial equations: A survey
From MaRDI portal
The authors state new and refined initial conditions which ensure the guaranteed convergence of the most frequently used simultaneous methods for solving algebraic equations. Smale's point estimation theory is applied to iterative methods for the simultaneous approximation of simple zeros of polynomial equations.
Recommendations
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Point estimation of root finding methods
- Safe convergence of simultaneous methods for polynomial zeros
- scientific article; zbMATH DE number 1313043
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
Cites work
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A family of root finding methods
- A family of simultaneous zero-finding methods
- A modified Newton method for polynomials
- A Note on the Convergence of Newton’s Method
- A parallel algorithm for simple roots of polynomials
- A posteriori error bounds for the zeros of polynomials
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Approximate Zeros of Quadratically Convergent Algorithms
- Börsch-supan-like methods: point estimation and parallel implementation
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Convergence and Complexity of Newton Iteration for Operator Equations
- Convergence of Newton’s method and inverse function theorem in Banach space
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 1194122 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- scientific article; zbMATH DE number 1124031 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 930560 (Why is no real title available?)
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- Improvement of a convergence condition for Durand-Kerner iteration
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- On dominating sequence method in the point estimate and Smale's theorem
- On initial conditions for the convergence of simultaneous root finding methods
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- On some methods for the simultaneous determination of polynomial zeros
- On the convergence of Wang-Zheng's method
- On the efficiency of algorithms of analysis
- On zero finding methods of higher order from data at one point
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Point estimation and some applications to iterative methods
- Point estimation of a family of simultaneous zero-finding methods
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Safe convergence of simultaneous methods for polynomial zeros
- The fundamental theorem of algebra and complexity theory
- The theory of Smale's point estimation and its applications
- Weierstrass formula and zero-finding methods
- Zur iterativen Auflösung algebraischer Gleichungen
Cited in
(24)- Safe convergence of simultaneous methods for polynomial zeros
- Local and global behavior for algorithms of solving equations
- A feasible implementation procedure for interval analysis method from measurement data
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Improved algorithms for computing determinants and resultants
- The convergence of a family of parallel zero-finding methods
- A new fourth-order family of simultaneous methods for finding polynomial zeros
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- The theory of Smale's point estimation and its applications
- The polynomial pivots as initial values for a new root-finding iterative method
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- Chebyshev-like root-finding methods with accelerated convergence
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- On a cubically convergent derivative-free root finding method
- On the guaranteed convergence of the square-root iteration method
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- The guaranteed convergence of Laguerre-like method
- An algorithm to initialize the search of solutions of polynomial systems
- On the convergence of the sequences of Gerschgorin-like disks
- Relationships between different types of initial conditions for simultaneous root finding methods
- Point estimation of root finding methods
This page was built for publication: Point estimation of simultaneous methods for solving polynomial equations: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948584)
