%0 Journal Article
%T MODIFICATION OF ALGORITHM FOR SELECTED TERM OF THE INTEGER EXTENDED EUCLIDEAN MATRIX SEQUENCE<br>整数扩展欧几里得矩阵序列的选择项算法的修正
%A DING Xiuhuan
%A ZHANG Shugong
%A TAN Chang
%A <br>丁秀欢
%A 张树功
%A 谭畅
%J 系统科学与数学
%D 2010
%I 
%X 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.
%K Modular rational number reconstruction
%K numerical rational number reconstruction
%K extended Euclidean algorithm<br>模有理数重构
%K 数值有理数重构
%K 扩展欧几里得算法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=66DB8289965B248AB57E7BAF864D402E&yid=140ECF96957D60B2&vid=340AC2BF8E7AB4FD&iid=38B194292C032A66&sid=84A93BA251D28205&eid=D1D63D047E37A053&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=11