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

DOI10.1007/11758532_84zbMath1157.65304OpenAlexW1499313636MaRDI QIDQ5503244

Christian Weihrauch, Simon Branford, Vassil Alexandrov, Ivan T. 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

performance analysis iterative process Monte Carlo algorithms computational cost matrix computations

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

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