A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices

Howard Cheng () and George Labahn ()
Additional contact information
Howard Cheng: University of Lethbridge, Department of Mathematics and Computer Science
George Labahn: University of Waterloo, Symbolic Computation Group, David R. Cheriton School of Computer Science

A chapter in Computer Mathematics, 2014, pp 49-59 from Springer

Abstract: Abstract We briefly review a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in $$\mathbb {Z}[t]$$ Z [ t ] , and describe a practical implementation in Maple that improves over previous modular and fraction-free versions. The algorithm can be used for finding the rank, left nullspace, and the Popov form of such matrices.

Keywords: Modulus Algorithm; Popov Form; Left Nullspace; Krylov Matrix; Common Left Multiples (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-43799-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783662437995

DOI: 10.1007/978-3-662-43799-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().