This web page contains the abstract of my paper:
"A Property of Euclid's Algorithm and an Application to Pade Approximation" with R.J. McEliece, SIAM J. Appl. Math., 34(1978), p. 611-615.
Abstract: If a and b are fixed polynomials with deg(a)>deg(b), we show that all solutions to the congruence q*b = p mod a with deg(q)+deg(p)<deg(a) can be obtained via euclid's algorithm. Using this result, we show that the Pade approximants to a given power series can also be obtained from Euclid's algorithm.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]