摘要
用网络求实对称矩阵的特征值及其相应的特征向量。从而实现矩阵的奇异值分 解。在只需求出几个较大特征值的情况下,这种方法比较简单并易于并行实现。文中还 提出逐步求矩阵的特征值和特征向量的剥去法。给出了有关证明和算例。
This paper finds the eigenvalues and eigenvectors of a real symmetric matrix with a network method for the purpose of calculating singular value decomposition. For cases with only a few larger eigenvalues to be determined, this method is simpler and can be completed easily with- parallel algorithm. The paper proposes also a peeling method used to find matrix eigenvalues and eigenvectors in successive steps. Related proofs and examples are given.
出处
《清华大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
1990年第4期46-54,共9页
Journal of Tsinghua University(Science and Technology)
关键词
网络法
奇异值分解
特征向量
矩阵
network method, SVD, eigenvector, eigenvalue, parallelism