An Algorithm for Computing Reducing Subspaces by Block Diagonalization.
An Algorithm for Computing Reducing Subspaces by Block Diagonalization.
复制标题
一种通过块对角化计算约简子空间的算法。
DOI：
--
复制
发表时间：
1979
期刊：
影响因子：
--
通讯作者：
G. Stewart
中科院分区：
文献类型：
--
作者：
Connice A. Bavely;G. Stewart
本文描述了一种通过实数相似变换将实数矩阵 A 简化为块对角线形式的算法。对应于块的变换的列跨越 A 的缩减子空间，并且该块是 A 在该子空间中相对于基的表示。该算法试图控制变换矩阵的条件，以便约简子空间得到良好的调节并且基向量在数值上独立。
This paper describes an algorithm for reducing a real matrix A to block diagonal form by a real similarity transformation. The columns of the transformation corresponding to a block span a reducing subspace of A, and the block is the representation of A in that subspace with respect to the basis. The algorithm attempts to control the condition of the transformation matrices, so that the reducing subspaces are well conditioned and the basis vectors are numerically independent.