Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powersDimov, I., Alexandrov, V., Branford, S. and Weihrauch, C. (2006) Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powers. Lecture Notes in Computer Science, 3993. pp. 632-639. ISSN 0302-9743 3540343830 Full text not archived in this repository. It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing. Abstract/SummaryIn this paper we present error analysis for a Monte Carlo algorithm for evaluating bilinear forms of matrix powers. An almost Optimal Monte Carlo (MAO) algorithm for solving this problem is formulated. Results for the structure of the probability error are presented and the construction of robust and interpolation Monte Carlo algorithms are discussed. Results are presented comparing the performance of the Monte Carlo algorithm with that of a corresponding deterministic algorithm. The two algorithms are tested on a well balanced matrix and then the effects of perturbing this matrix, by small and large amounts, is studied.
Deposit Details University Staff: Request a correction | Centaur Editors: Update this record |
Lists
Lists
