Inversion modulo zero-dimensional regular chains

Authors:
Marc Moreno Maza;Éric Schost;Paul Vrbik
Affiliations:
Department of Computer Science, Western University, Canada;Department of Computer Science, Western University, Canada;Department of Computer Science, Western University, Canada
Venue:
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Year:
2012

Citing 12
Cited 0

Fast construction of irreducible polynomials over finite fields

Journal of Symbolic Computation
Modern computer algebra

Modern computer algebra
Efficient computation of minimal polynomials in algebraic extensions of finite fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Polynomial Gcd Computations over Towers of Algebraic Extensions

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
About a New Method for Computing in Algebraic Number Fields

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Lifting techniques for triangular decompositions

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Change of order for regular chains in positive dimension

Theoretical Computer Science
Fast arithmetic for triangular sets: From theory to practice

Journal of Symbolic Computation
Computations modulo regular chains

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fast computation of special resultants

Journal of Symbolic Computation
Algebraic Complexity Theory

Algebraic Complexity Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the questions of inversion modulo a regular chain in dimension zero and of matrix inversion modulo such a regular chain. We show that a well-known idea, Leverrier's algorithm, yields new results for these questions.