MODIFICATION OF ALGORITHM FOR SELECTED TERM OF THE INTEGER EXTENDED EUCLIDEAN MATRIX SEQUENCE
整数扩展欧几里得矩阵序列的选择项算法的修正

Wang and Pan proposed an algorithm for computing a selected term of the integer extended Euclidean matrix sequence, and use it for the modular rational number reconstruction problems. The algorithm only spent nearly linear time, matching the known complexity bound for the integer gcd, which is a special case of the algorithm. In this paper, by analyzing the algorithm, we point out an error in relevant reference, then complement the properties of the matrix sequence, finally modify the algorithm.