Parallel computation of determinants of matrices with polynomial entries
نویسندگان
چکیده
منابع مشابه
Extension of matrices with Laurent polynomial entries
Let P and Q be nr, r n matrices with Laurent polynomial entries. Suppose that Q T (z)P (z) = I r , z 2 Cnf0g. This note provides an algorithmatic construction of two n(nr) matrices G and H with Laurent polynomial entries such that the nn matrices
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولParallel Computation of Entries of A-1
In this paper, we are concerned about computing in parallel several entries of the inverse of a large sparse matrix. We assume that the matrix has already been factorized by a direct method and that the factors are distributed. Entries are efficiently computed by exploiting sparsity of the right-hand sides and the solution vectors in the triangular solution phase. We demonstrate that in this se...
متن کاملSome Matrices with Nilpotent Entries, and Their Determinants
The present note is really a Section in a forthcoming treatise [4] on differential forms in the context of Synthetic Differential Geometry (elaborating on [2], [3], [1]); but since the methods of this Section fall entirely within elementary linear algebra over a commutative ring R, we believe that it might be of more general interest, and worthwile a separate publication. The base ring R over w...
متن کاملParallel Inversion of Polynomial Matrices
This paper presents an overview of diierent methods proposed in the last several decades for computing the inverse of a polynomial matrix, concentrating on Buss lowicz's algorithm. A detailed description of Buss lowicz's algorithm and its sequential implementation is followed by the presentation of a new parallel algorithm, based on Buss lowicz's. The distributed and shared memory versions of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2004
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2003.11.002