On lattice reduction for polynomial matrices
OPEN ACCESS
Loading...
Author / Producer
Date
2000-12
Publication Type
Report
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
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.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
356
Pages / Article No.
Publisher
ETH Zurich, Department of Computer Science
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Funding
Related publications and datasets
Is previous version of: