Block algorithms for reordering standard and generalized Schur forms

被引:11
|
作者
Kressner, Daniel [1 ]
机构
[1] Univ Zagreb, Dept Math, Zagreb 10000, Croatia
来源
关键词
algorithms; performance; Schur form; reordering; invariant subspace; deflating subspace;
D O I
10.1145/1186785.1186787
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:521 / 532
页数:12
相关论文
共 50 条