Sciweavers

JSC
2006

Fraction-free row reduction of matrices of Ore polynomials

14 years 14 days ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspace of such matrices. When specialized to matrices of skew polynomials our reduction can be used for computing a weak Popov form of such matrices and for computing a GCRD and an LCLM of skew polynomials or matrices of skew polynomials. The algorithm is suitable for computation in exact arithmetic domains where the growth of coefficients in intermediate computations is a concern. This coefficient growth is controlled by using fraction-free methods. The known factor can be predicted and removed efficiently. c 2005 Elsevier Ltd. All rights reserved.
Bernhard Beckermann, Howard Cheng, George Labahn
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JSC
Authors Bernhard Beckermann, Howard Cheng, George Labahn
Comments (0)