An improved parallel processor bound in fast matrix inversion
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Fast Parallel Matrix Inversion Algorithms
- Time and Parallel Processor Bounds for Linear Recurrence Systems
Cited in
(20)- The Faddeev-LeVerrier algorithm and the Pfaffian
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Upper bounds on the complexity of solving systems of linear equations
- Inversion modulo zero-dimensional regular chains
- Parametrization of Newton's iteration for computations with structured matrices and applications
- On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Parallel computations in linear algebra. II
- Parallel complexities and computations of cholesky's decomposition and QR factorization
- Fast and efficient parallel solution of dense linear systems
- Improved processor bounds for combinatorial problems in RNC
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- Subtree isomorphism is in random NC
- Efficient algorithms for computing the characteristic polynomial in a domain
- Directed evaluation
- Oracle computations in parallel numerical linear algebra
- An improved parallel algorithm for computing the generalized inverse A^ +
- Parallel evaluation of the determinant and of the inverse of a matrix
- Complexity of parallel matrix computations
- Parallelism and fast solution of linear systems
This page was built for publication: An improved parallel processor bound in fast matrix inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244782)
