Data parallel evaluation-interpolation algorithm for polynomial matrix inversion

Krishnamurthy, E. V. ; Pin, Chen (1993) Data parallel evaluation-interpolation algorithm for polynomial matrix inversion Parallel Computing, 19 (5). pp. 577-589. ISSN 0167-8191

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/016781...

Related URL: http://dx.doi.org/10.1016/0167-8191(93)90007-8

Abstract

This paper describes a data parallel algorithm for the inversion of polynomial matrix using evaluation and rational interpolation. The algorithm generates the inverse matrix whose elements are continued fractions, in time complexity O(max(tm, n2)) for an (m × m) polynomial matrix, whose determinant has an estimated degree n, t is the number of iteration to obtain an inverse (or Moore-Penrose inverse). The implementation of the algorithm has been done on the Connection Machine in CM FORTRAN using at most (m2(n+1)) processors. This algorithm can be directly extended to invert arbitrary function matrices by proper choice of evaluation-interpolation points.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Linear Algebra; Matrix Inversion; Rational Interpolation; Continued Fractions; Connection Machine
ID Code:28212
Deposited On:15 Dec 2010 12:24
Last Modified:04 Jun 2011 06:58

Repository Staff Only: item control page