The relative costs of the Monte Carlo method for solving systems of linear algebraic equations

zbMATH Open0852.65027MaRDI QIDQ1921611

D. L. Danikov, Sergeĭ Mikhaĭlovich Ermakov

Publication date: 28 August 1996

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

parallel computationMonte Carlo methodsNeumann-Ulam schemeiterational methods

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Title not available (Why is that?) ⋮ Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimization of the quasi-Monte Carlo algorithm for solving systems of linear algebraic equations 👍 👎
• Solving systems of linear equations with relaxed Monte Carlo method 👍 👎
• The Monte-Carlo algorithm for the solving of systems of linear algebraic equations by the Seidel method 👍 👎
• Asymptotic complexity of Monte Carlo methods for solving linear systems 👍 👎
• The Monte Carlo method for solving large systems of linear ordinary differential equations 👍 👎
• A new Monte Carlo method for solving systems of linear algebraic equations 👍 👎

This page was built for publication: The relative costs of the Monte Carlo method for solving systems of linear algebraic equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921611)