Randomization and the parallel solution of linear algebra problems
From MaRDI portal
Publication:1905899
DOI10.1016/0898-1221(95)00164-TzbMath0835.65062OpenAlexW2111564219MaRDI QIDQ1905899
Publication date: 22 April 1996
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(95)00164-t
randomizationparallel computationMonte Carlo methoderror boundrankdeterminantrandomized algorithmspower methoddominant eigenvalue
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Matrix inversion in RNC\(^ 1\)
- The Area-Time Complexity of Binary Multiplication
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Parallelism in random access machines
This page was built for publication: Randomization and the parallel solution of linear algebra problems
