On a family of parallel root-finding methods for generalized polynomials
From MaRDI portal
Publication:1294149
DOI10.1016/S0096-3003(97)10022-4zbMath0944.65052MaRDI QIDQ1294149
Publication date: 24 September 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
convergencenumerical resultsnumerical stabilityzeros of generalized polynomials\(E\)-polynomial\(T\)-polynomialHansen-Patrick methods
Ordinary representations and characters (20C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
Related Items
Cites Work
- Generalized Ostrowski root-finding method
- Efficient iterative algorithms for bounding the inverse of a matrix
- A family of root finding methods
- The numerical stability of simultaneous iterations via square-rooting
- A posteriori error bounds for the zeros of polynomials
- The Representation of Complex Circular Functions Using Taylor Series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item