Symbolic iterative algorithm for generalised inversion of rational polynomial matrices

Krishnamurthy, E. V. (1985) Symbolic iterative algorithm for generalised inversion of rational polynomial matrices Journal of Symbolic Computation, 1 (3). pp. 271-281. ISSN 0747-7171

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

Related URL: http://dx.doi.org/10.1016/S0747-7171(85)80036-5

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(m34logR) 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.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:85937
Deposited On:06 Mar 2012 13:54
Last Modified:06 Mar 2012 13:54

Repository Staff Only: item control page