论文信息 - A summary of block schemes for reducing a general matrix to Hessenberg form

A summary of block schemes for reducing a general matrix to Hessenberg form

Various strategies have been proposed for arriving at block algorithms for reducing a general matrix to Hessenberg form by means of orthogonal similarity transformations. This paper reviews and systematically categorizes the various strategies and discusses their computational characteristics.

C. H. Bischof | C. Bischof

[1] C. Puglisi. Modification of the householder method based on the compact WY representation , 1992 .

[2] Jack J. Dongarra,et al. Evaluating Block Algorithm Variants in LAPACK , 1989, PPSC.

[3] Christian H. Bischof,et al. The WY representation for products of householder matrices , 1985, PPSC.

[4] C. Loan,et al. A Storage-Efficient $WY$ Representation for Products of Householder Transformations , 1989 .

[5] Jack Dongarra,et al. A Project for Developing a Linear Algebra Library for High-Performance Computers , 1989 .

[6] A. Dubrulle,et al. On block Householder algorithms for the reduction of a matrix to Hessenberg form , 1988, Proceedings Supercomputing Vol.II: Science and Applications.

[7] H. Walker. Implementation of the GMRES method using householder transformations , 1988 .

[8] Christian H. Bischof,et al. Fundamental Linear Algebra Computations on High- Performance Computers , 1990, Supercomputer.

[9] D. Sorensen,et al. Block reduction of matrices to condensed forms for eigenvalue computations , 1990 .

[10] Christian H. Bischof,et al. A block QR factorization algorithm using restricted pivoting , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).