Rights / licenseIn Copyright - Non-Commercial Use Permitted
A simple algorithm for transformation to weak Popov form | essentially lattice reduction for polynomial matrices | is described and analyzed. The algorithm is adapted and applied to various tasks involving polynomial matrices: rank prole and determinant computation; unimodular triangular factorization; transformation to Hermite and Popov canonical form; rational and diophantine linear system solving; short vector computation Show more
Journal / seriesTechnical report / Department of Computer Science, ETH Zürich
PublisherETH, Eidgenössische Technische Hochschule, Department of Computer Science, Institute of Scientific Computing
Organisational unit02150 - Departement Informatik / Department of Computer Science
NotesTechnical Reports D-INFK.
MoreShow all metadata