Parallel factorizations of matrix polynomials over an arbitrary field
From MaRDI portal
Publication:677941
DOI10.1007/BF02362586zbMATH Open0868.15012WikidataQ114233836 ScholiaQ114233836MaRDI QIDQ677941FDOQ677941
Authors: V. M. Prokip
Publication date: 25 May 1997
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Factorization of polynomial matrices over arbitrary fields
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- On divisibility and factorization of matrices.
- Title not available (Why is that?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Title not available (Why is that?)
- On the factorization of polynomial matrices over the domain of principal ideals
- Title not available (Why is that?)
This page was built for publication: Parallel factorizations of matrix polynomials over an arbitrary field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677941)