A Monte Carlo method for the parallel solution of linear systems

DOI10.1016/0885-064X(89)90016-2zbMath0672.65013MaRDI QIDQ1120249

Bruno Codenotti, Franco Flandoli

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

complexitylinear systemMonte Carlo methodsplittingparallel algorithmChebyshev inequalitynumberof processorsprobabilistic error bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Matrix inversion in RNC\(^ 1\)

Cites Work

• Fast and efficient parallel solution of dense linear systems
• The Area-Time Complexity of Binary Multiplication
• Fast Parallel Matrix Inversion Algorithms
• Unnamed Item

This page was built for publication: A Monte Carlo method for the parallel solution of linear systems