Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A (hopefully) friendly introduction to the complexity of polynomial matrix computations

Claude-Pierre Jeannerod 1, 2, *
* Corresponding author
2 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, and surveys the results of the ISSAC 2003 paper 'On the Complexity of Polynomial Matrix Computations' by Pascal Giorgi, Claude-Pierre Jeannerod, and Gilles Villard.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-00793484
Contributor : Claude-Pierre Jeannerod <>
Submitted on : Thursday, March 7, 2013 - 10:49:03 AM
Last modification on : Friday, June 25, 2021 - 3:40:05 PM
Long-term archiving on: : Monday, June 17, 2013 - 11:09:29 AM

File

overview.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00793484, version 1

Collections

Citation

Claude-Pierre Jeannerod. A (hopefully) friendly introduction to the complexity of polynomial matrix computations. 2003. ⟨hal-00793484⟩

Share

Metrics

Record views

307

Files downloads

150