Parallel square-root iterations for multiple roots
From MaRDI portal
Publication:1140408
DOI10.1016/0898-1221(80)90035-8zbMath0435.65044OpenAlexW2012084361MaRDI QIDQ1140408
Publication date: 1980
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(80)90035-8
numerical exampleserror boundsconvergence rateLaguerre's methodmultiple complex rootsparalle square-root iterationssimple roots of a polynomial
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Related Items
Family of simultaneous methods of Hansen--Patrick's type, Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple 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, On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity, The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic, The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros
Cites Work
- Unnamed Item
- Parallel Laguerre iterations: The complex case
- The numerical stability of simultaneous iterations via square-rooting
- Circular arithmetic and the determination of polynomial zeros
- Principles for Testing Polynomial Zerofinding Programs
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
