Inversion Modulo Zero Dimensional Regular Chains.
Paul Vrbik, Department of Computer Science, University of Western Ontario
The question of inverting a matrix of polynomials modulo a zero dimensional regular chain (a triangular set encoding a finite number of solutions) is considered. We show that resurrecting the well-known Leverrier's algorithm yields new results for this question. Experimental and complexity results are given. This is joint work with Marc Moreno Maza.