摘要
应用矩阵的初等变换不改变矩阵的秩的理论,将一个可逆矩阵分解为两个向量乘积之和,再运用求(G+uvT)-1的公式,建立并给出了求逆矩阵的迭代公式。
In the paper, the author uses the theory of elementary transformation of the matrix, unchanging the matrix rank, putting the invertible matrix into two vector product sum. The author reuses the formula ( G + uv^T) ^- 1 to give the iteration formula of inverse matrix.
出处
《长春工程学院学报(自然科学版)》
2005年第4期63-64,共2页
Journal of Changchun Institute of Technology:Natural Sciences Edition
关键词
逆矩阵
矩阵的秩
迭代
inverse matrix
rank of a matrix
iteration