A (hopefully) friendly introduction to the complexity of polynomial matrix computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2003

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

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.
Fichier principal
Vignette du fichier
overview.pdf (37.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00793484 , version 1 (07-03-2013)

Identifiers

  • HAL Id : hal-00793484 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More