摘要
在本文中,我们给出一个无重复生成所有可逆矩阵的算法,并估计了该算法的计算复杂度.
In this paper, an algorithm generating all the invertible square matrices without any repetition is given, and the computational complexity of this algorithm is evaluated.
出处
《数学杂志》
CSCD
1999年第3期270-276,共7页
Journal of Mathematics