Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439)

From MaRDI portal
Revision as of 08:47, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    6 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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