Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers (Q5503244)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5490116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9215456
0 references
0.8682081
0 references
0.84762394
0 references
0.8471613
0 references
0.84676474
0 references
0 references
0 references
