Symbolic Computation Group
David R. Cheriton School of Computer Science


Friday, December 9, 2005, at Maplesoft, Waterloo, Ontario.
Abstract: At a recent talk at the Banff Research Station, Pascal Giorgi described a fast algorithm for solving sparse integer linear systems A x = b making use of Hensel lifting. During the intermediate steps Pascal made use of an inversion formula for the inversion of a nonsingular block Hankel matrix in order to improve the complexity. In this talk we show how such inversion formula come about along with their usage in both exact and approximate arithmetic environments.

Last modified on Sunday, 04 November 2012, at 15:42 hours.