Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers (Q5503244)
From MaRDI portal
scientific article; zbMATH DE number 5490116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers |
scientific article; zbMATH DE number 5490116 |
Statements
Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers (English)
0 references
13 January 2009
0 references
Monte Carlo algorithms
0 references
matrix computations
0 references
performance analysis
0 references
computational cost
0 references
iterative process
0 references
