Symbolic Iterative Algorithm for Generalised Inversion of Rational Polynomial Matrices

  • Authors:

  • E. V. Krishnamurthy

  • Affiliations:

  • Department of Computer Science, University of Waikato, Hamilton, New Zealand

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

A symbolic iterative algorithm, based on Hensel's lemma and the Newton-Schultz method, is described for the generalised inversion of rational polynomial matrices over a field. The approach presented here unifies the computational framework for the inversion of both the numerical and polynomial matrices and provides the possibility for parallel implementation using array processors. This algorithm requires O(m^34^l^o^g^R) polynomial multiplications over a field, where m is the order of the matrix and the R the maximal degree of the rational polynomial element in the generalised inverse.