Pages that link to "Item:Q2248050"
From MaRDI portal
The following pages link to An efficient Monte Carlo solution for problems with random matrices (Q2248050):
Displaying 13 items.
- Using the Monte Carlo method for fast simulation of the number of ``good'' permutations on the SCIT-4 multiprocessor computer complex (Q289789) (← links)
- Efficient bounds for the Monte Carlo-Neumann solution of stochastic systems (Q298530) (← links)
- A way to obtain Monte Carlo matrix inversion with minimal error (Q990422) (← links)
- Monte Carlo approaches to parameterized poker squares (Q1989566) (← links)
- A Monte Carlo method for computing the action of a matrix exponential on a vector (Q2286060) (← links)
- Monte Carlo algorithm for vector-valued Gaussian functions with preset component accuracies (Q2409055) (← links)
- A method for solving stochastic equations by reduced order models and local approximations (Q2446964) (← links)
- A monte carlo method for factorization (Q4071300) (← links)
- (Q4365843) (← links)
- Estimates of System Response Maxima by Extreme Value Theory and Surrogate Models (Q4636411) (← links)
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication (Q5470749) (← links)
- Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers (Q5503244) (← links)
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix (Q5885812) (← links)
