Output-sensitive modular algorithms for polynomial matrix normal forms

We give modular algorithms to compute row-reduced forms, weak Popov forms, and Popov forms of polynomial matrices, as well as the corresponding unimodular transformation matrices. Our algorithms improve on existing fraction-free algorithms. In each case, we define lucky homomorphisms, determine the...

Full description

Saved in:
Bibliographic Details
Published in:Journal of symbolic computation Vol. 42; no. 7; pp. 733 - 750
Main Authors: Cheng, Howard, Labahn, George
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.07.2007
Subjects:
ISSN:0747-7171, 1095-855X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first