Normal Forms for General Polynomial Matrices

Abstract : We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two matrix polynomials (in normal form) or such polynomial normal form computation as the classical Popov form and the Hermite Normal Form. The method is done by embedding the problem of computing shifted forms into one of computing matrix rational approximants. This has the advantage of allowing for fraction-free computations over integral domains such as Z[z] or K [z_1,..., z_n][z].
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101933
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:10:07 AM
Last modification on : Friday, May 17, 2019 - 1:39:18 AM

File

RR2002-01.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101933, version 1

Collections

Citation

Bernd Beckermann, George Labahn, Gilles Villard. Normal Forms for General Polynomial Matrices. [Research Report] LIP RR-2002-1, Laboratoire de l'informatique du parallélisme. 2002, 2+31p. ⟨hal-02101933⟩

Share

Metrics

Record views

6

Files downloads

23