Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers

DOI10.1007/11758532_84MaRDI QIDQ5503244zbMATH OpenOpenAlexFDO

Authors Christian Weihrauch, Simon Branford, V. N. Alexandrov, I. Dimov

Publication date 13 January 2009

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758532_84

zbMATH Keywords

computational costiterative processmatrix computationsMonte Carlo algorithmsperformance analysis

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Recommendations

• Error Analysis of a Monte Carlo Algorithm for Computing Bilinear Forms of Matrix Powers
• The relative costs of the Monte Carlo method for solving systems of linear algebraic equations
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Asymptotic complexity of Monte Carlo methods for solving linear systems
• Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices
• scientific article; zbMATH DE number 5899420
• Numerical comparison of Monte Carlo methods for linear systems
• An efficient Monte Carlo solution for problems with random matrices
• On Monte Carlo and quasi-Monte Carlo for matrix computations

Cited in

(1)

• Error Analysis of a Monte Carlo Algorithm for Computing Bilinear Forms of Matrix Powers

This page was built for publication: Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers

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