Relaxing order basis computation - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Article Dans Une Revue ACM Communications in Computer Algebra Année : 2014

Relaxing order basis computation

Résumé

The computation of an order basis (also called sigma basis) is a fundamental tool for linear algebra with polynomial coefficients. Such a computation is one of the key ingredients to provide algorithms which reduce to polynomial matrices multiplication. This has been the case for column reduction or minimal nullspace basis of polynomial matrix over a field. In this poster, we are interested in the application of order basis to compute minimal matrix generators of a linear matrix sequence. In particular, we focus on the linear matrix sequence used in the Block Wiedemann algorithm.
Fichier principal
Vignette du fichier
poster-issac-2014.pdf (211.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

lirmm-01372532 , version 1 (27-09-2016)

Identifiants

Citer

Pascal Giorgi, Romain Lebreton. Relaxing order basis computation. ACM Communications in Computer Algebra, 2014, 47 (3/4), pp.100-101. ⟨10.1145/2576802.2576813⟩. ⟨lirmm-01372532⟩
289 Consultations
273 Téléchargements

Altmetric

Partager

More