Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Jean-Guillaume Dumas 1 Erich Kaltofen 2 Emmanuel Thomé 3 Gilles Villard 4, 5
3 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
4 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Certificates to a linear algebra computation are additional data structures for each output, which can be used by a—possibly randomized— verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that compute a certificate for the minimal polynomial of sparse or structured n × n matrices over an abstract field, of sufficiently large cardinality, whose Monte Carlo verification complexity requires a single matrix-vector multiplication and a linear number of extra field operations. We also propose a novel preconditioner that ensures irreducibility of the characteristic polynomial of the preconditioned matrix. This preconditioner takes linear time to be applied and uses only two random entries. We then combine these two techniques to give algorithms that compute certificates for the determinant, and thus for the characteristic polynomial, whose Monte Carlo verification complexity is therefore also linear.
Type de document :
Communication dans un congrès
Xiao-Shan Gao. International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. ACM, ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation. <http://www.issac-conference.org/2016/>


https://hal.archives-ouvertes.fr/hal-01266041
Contributeur : Jean-Guillaume Dumas <>
Soumis le : lundi 1 février 2016 - 23:12:53
Dernière modification le : vendredi 2 décembre 2016 - 11:28:24
Document(s) archivé(s) le : samedi 12 novembre 2016 - 01:46:12

Fichiers

det_techreport.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01266041, version 1
  • ARXIV : 1602.00810

Citation

Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard. Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. Xiao-Shan Gao. International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. ACM, ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation. <http://www.issac-conference.org/2016/>. <hal-01266041>

Partager

Métriques

Consultations de
la notice

367

Téléchargements du document

102