Fraction-free row reduction of matrices of Ore polynomials

• Autores: George Labahn, Bernhard Beckermann, Howard Cheng
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 5, 2006, págs. 513-543
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.