Computing a factor of a polynomial by means of multishift LR algorithms

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 1, 1998, Pages 161-181

  Gemignani, Luca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032354165     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894277442     Document Type: Article

References (20)

1. Z. BAI AND J. W. DEMMEL, On a block implementation of the Hessenberg multishift QR iteration, J. High-Speed Comput., 1 (1989), pp. 97-112.
2. D. BINI, Numerical computation of polynomial zeros by means of Aberth's method, Numer. Algorithms, 13 (1996), pp. 179-200.
3. D. BINI AND L. GEMIGNANI, On the complexity of polynomial zeros, SIAM J. Comput., 21 (1992), pp. 781-799.
4. J. J. BUONI, P. A. FARRELL, AND A. RUTTAN, Parallel LU decomposition of upper Hessenberg matrices on a shared memory multiprocessor, in Comput. Appl. Math., C. Brezinski and U. Kulish, eds., Elsevier, North-Holland, Amsterdam, 1992.
5. C. CARSTENSEN AND T. SAKURAI, Simultaneous factorization of a polynomial by rational approximation, J. Comput. Appl. Math., 61 (1995), pp. 165-178.
6. T. J. DEKKER AND J. F. TRAUB, An analysis of the shifted LR algorithm, Numer. Math., 17 (1971), pp. 179-188.
7. T. J. DEKKER AND J. F. TRAUB, The shifted QR algorithm for Hermitian matrices, Linear Algebra Appl., 4 (1971), pp. 137-154.
8. A. A. DUBRULLE AND G. H. GOLUB, A multishift QR iteration without computation of the shifts, Numer. Algorithms, 7 (1994), pp. 173-181.
9. T. L. FREEMAN AND R. W. BRANKIN, A divide and conquer method for polynomial zeros, J. Comput. Appl. Math., 30 (1990), pp. 71-79.
10. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1990.
11. M. A. JENKINS AND J. F. TRAUB, A three-stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numer. Math., 14 (1970), pp. 256-263.
12. M. A. JENKINS AND J. F. TRAUB, A three-stage algorithm for real polynomials using quadratic iteration, SIAM J. Numer. Anal., 7 (1970), pp. 545-566.
13. J. KAUTSKY AND G. H. GOLUB, On the calculation of Jacobi matrices, Linear Algebra Appl., 52/53 (1983), pp. 439-455.
14. A. S. HOUSEHOLDER, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970.
15. H. RUTISHAUSER, Lectures on Numerical Mathematics, Birkhäuser, Boston, MA, 1990.
16. T. SAKURAI, H. SUGIURA, AND T. TORRI, Numerical factorization of a polynomial by rational Hermite interpolation. Numer. Algorithms, 3 (1992), pp. 411-418.
17. A. SCHÖNHAGE, The Fundamental Theorem of Algebra in Terms of Computational Complexity, Tech. report, Department of Mathematics, University of Tubingen, Federal Republic of Germany, 1982.
18. G. W. STEWART, On the companion operator for analytic functions, Numer. Math., 18 (1971), pp. 26-43.
19. D. S. WATKINS AND L. ELSNER, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
20. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, London, 1965.