《数学通报》1990年第1期刊登译文《求矩阵秩的一个新算法》(原载美国数学月刊)。该方法的优点,其一解决了住用行初等变换化阶梯形矩阵的过程中,“不知用那一行为基准行更为合适”,这样一个不确定性因素,其二,保证当A是整数矩阵时,变换过程中只需进行整数运算, “Mathematics Bulletin” published in 1990, “a new algorithm to find the rank of the matrix” (original in the American Mathematics Monthly). One of the advantages of this method is that it solves the problem of “doing not use that behavior to make the baseline row more appropriate” in the process of transforming the ladder-shaped matrix into a row, and thus guarantees that when A is an integer, it is an uncertain factor. In the matrix, only integer operations need to be performed during the transformation.