Solving Hankel systems over the integers
A new algorithm is presented for computing the solution of a Hankel system with integer entries by means of structured matrix techniques. By combining subresultant theory and factorization properties of Hankel matrices, the author proves that this algorithm has a Boolean sequential cost which is almost optimal among the algorithms based on fast integer LU factorization.
scientific article; zbMATH DE number 792843