Parallel evaluation of the determinant and of the inverse of a matrix
From MaRDI portal
Publication:1115596
DOI10.1016/0020-0190(89)90173-7zbMath0664.68040OpenAlexW2072582972MaRDI QIDQ1115596
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90173-7
Related Items
Oracle computations in parallel numerical linear algebra, Specified precision polynomial root isolation is in NC, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Fast rectangular matrix multiplication and some applications, Parametrization of Newton's iteration for computations with structured matrices and applications, Fast rectangular matrix multiplication and applications, Fast and efficient parallel solution of dense linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- How to multiply matrices faster
- Matching is as easy as matrix inversion
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Complexity of parallel matrix computations
- On the asymptotic complexity of rectangular matrix multiplication
- An improved parallel processor bound in fast matrix inversion
- Improved processor bounds for combinatorial problems in RNC
- Rapid Multiplication of Rectangular Matrices
- Fast Parallel Matrix Inversion Algorithms
- Fast parallel matrix and GCD computations