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)
convergence; numerical results; numerical stability; zeros of generalized polynomials; \(E\)-polynomial; \(T\)-polynomial; Hansen-Patrick methods
20C15: Ordinary representations and characters
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
65H05: Numerical computation of solutions to single equations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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