Pages that link to "Item:Q1973275"
From MaRDI portal
The following pages link to Asymptotic complexity of Monte Carlo methods for solving linear systems (Q1973275):
Displaying 15 items.
- Monte Carlo simulation via a numerical algorithm for solving a nonlinear inverse problem (Q720144) (← links)
- On construction of parallel algorithms in problems of computational mathematics (Q735602) (← links)
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods (Q933418) (← links)
- Optimization of the quasi-Monte Carlo algorithm for solving systems of linear algebraic equations (Q946046) (← links)
- Complexity theory of numerical linear algebra (Q1103328) (← links)
- Complexity of the Neumann-Ulam scheme for solving a system of grid equations of the multidimensional Dirichlet problem (Q1373585) (← links)
- Addendum to a paper on the Monte Carlo method (Q1395299) (← links)
- Stochastic and quasistochastic computations (Q1759522) (← links)
- The relative costs of the Monte Carlo method for solving systems of linear algebraic equations (Q1921611) (← links)
- Asymptotic complexity of the collisions estimator for solving linear systems (Q1975767) (← links)
- Stochastic version of the degenerate kernel method for solving large systems of linear equations with sparse matrix (Q2345963) (← links)
- Biological applications and numerical solution based on Monte Carlo method for a two-dimensional parabolic inverse problem (Q2378884) (← links)
- Monte Carlo method via a numerical algorithm to solve a parabolic problem (Q2383905) (← links)
- (Q3002925) (← links)
- Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers (Q5503244) (← links)
