Block algorithms for reordering standard and generalized Schur forms

Block algorithms for reordering a selected set of eigenvalues in a standard or generalized Schur form are proposed. Efficiency is achieved by delaying orthogonal transformations and (optionally) making use of level 3 BLAS operations. Numerical experiments demonstrate that existing algorithms, as currently implemented in LAPACK, are outperformed by up to a factor of four.


Published in:
ACM Transactions on Mathematical Software, 32, 4, 521-532
Year:
2006
Publisher:
Association for Computing Machinery
ISSN:
0098-3500
Keywords:
Laboratories:




 Record created 2011-05-05, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)