RGSD an algorithm for computing the Kronecker structure and reducing subspaces of singular A-lB pencils
RGSD an algorithm for computing the Kronecker structure and reducing subspaces of singular A-lB pencils
复制标题
RGSD 一种计算 Kronecker 结构并减少奇异 A-1B 铅笔子空间的算法
DOI:
--
复制
发表时间:
1986
期刊:
影响因子:
--
通讯作者:
B. Kågström
中科院分区:
文献类型:
--
作者:
B. Kågström
An algorithm (RGSVD) for computing the structure elements associated with the Kronecker canonical form (KCF) of a matrix pencil $A - lambda B$, where A and B are complex m by n matrices, is presented. RGSVD is based on repeated generalized singular value decompositions (or more precisely cosine-sine decompositions of partitioned orthonormal matrices). It extracts the structures of the zero and/or the infinite eigenvalues together with the left (row) or right (column) minimal indices of $A - lambda B$. By accumulating equivalence transformations, RGSVD also produces pairs of reducing subspaces associated with e.g. the zero structure and the right Kronecker indices.