On Grau’s Method for Simultaneous Factorization of Polynomials
- 1 April 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 29 (2) , 601-613
- https://doi.org/10.1137/0729039
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Inclusion of the roots of a polynomial based on Gerschgorin's theoremNumerische Mathematik, 1991
- A unified approach to methods for the simultaneous computation of all zeros of generalized polynomialsNumerische Mathematik, 1988
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zerosACM Transactions on Mathematical Software, 1986
- Iterative Solution of the Generalized Eigenvalue ProblemIMA Journal of Applied Mathematics, 1976
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial RootsSIAM Journal on Numerical Analysis, 1974
- The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a PolynomialSIAM Journal on Numerical Analysis, 1971
- “Some iterations for factoring a polynomial”Numerische Mathematik, 1969
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von PolynomenNumerische Mathematik, 1966