Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/mcma.2009.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080755976 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method |
scientific article |
Statements
Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (English)
0 references
6 January 2010
0 references
random sparsification
0 references
sampling with and without replacement
0 references
standard isotropic random walk on boundary process
0 references
randomization of iterative methods
0 references
comparison of methods
0 references
numerical examples
0 references
Laplace equation
0 references
Monte Carlo algorithms
0 references
large systems of linear algebraic equations
0 references
stochastic algorithms
0 references
matrix-vector product
0 references
matrix iterations
0 references
Markov chain
0 references
Neumann-Ulam method
0 references
boundary integral equation
0 references
