Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3635964 (Why is no real title available?)
- Circular arithmetic and the determination of polynomial zeros
- Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- On the convergence order of a modified method for simultaneous finding polynomial zeros
Cited in
(10)- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
- scientific article; zbMATH DE number 1131781 (Why is no real title available?)
- scientific article; zbMATH DE number 440790 (Why is no real title available?)
- scientific article; zbMATH DE number 4037051 (Why is no real title available?)
- The globalization of Durand-Kerner algorithm
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- The Root Separation of Polynomials and Some Applications
- Algebraic complexity of computing polynomial zeros
- On the determination of the safe initial approximation for the Durand- Kerner algorithm
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
This page was built for publication: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262084)