An improved parallel processor bound in fast matrix inversion
From MaRDI portal
Publication:1244782
DOI10.1016/0020-0190(78)90079-0zbMath0373.65020OpenAlexW2027333436MaRDI QIDQ1244782
Franco P. Preparata, Dilip V. Sarwate
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90079-0
Related Items (20)
Oracle computations in parallel numerical linear algebra ⋮ The Faddeev-LeVerrier algorithm and the Pfaffian ⋮ Complexity of parallel matrix computations ⋮ Inversion Modulo Zero-Dimensional Regular Chains ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ Parallel evaluation of the determinant and of the inverse of a matrix ⋮ Directed evaluation ⋮ Parallelism and fast solution of linear systems ⋮ On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices ⋮ Subtree isomorphism is in random NC ⋮ Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers ⋮ Parallel complexities and computations of cholesky's decomposition and QR factorization ⋮ Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic ⋮ An improved parallel algorithm for computing the generalized inverse \(A^ +\) ⋮ Efficient algorithms for computing the characteristic polynomial in a domain ⋮ Parametrization of Newton's iteration for computations with structured matrices and applications ⋮ Parallel computations in linear algebra. II ⋮ Improved processor bounds for combinatorial problems in RNC ⋮ Fast and efficient parallel solution of dense linear systems ⋮ Upper bounds on the complexity of solving systems of linear equations
Cites Work
This page was built for publication: An improved parallel processor bound in fast matrix inversion
