Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme

DOI10.1007/978-3-642-18466-6_2zbMath1317.65020OpenAlexW1489479125MaRDI QIDQ3075261

K. K. Sabel'fel'd

Publication date: 11 February 2011

Published in: Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18466-6_2

Mathematics Subject Classification ID

Related Items (4)

Vector Monte Carlo stochastic matrix-based algorithms for large linear systems ⋮ Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations ⋮ A new randomized vector algorithm for iterative solution of large linear systems ⋮ Global random walk on grid algorithm for solving Navier-Stokes and Burgers equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
• Clustering large graphs via the singular value decomposition
• A fast randomized algorithm for the approximation of matrices
• A randomized Kaczmarz algorithm with exponential convergence
• Robustness and applicability of Markov chain Monte Carlo algorithms for eigenvalue problems
• Rapid solution of integral equations of classical potential theory
• Estimation of singular values of very large matrices using random sampling
• Randomized algorithms for the low-rank approximation of matrices
• Extensions of Lipschitz mappings into a Hilbert space
• Random Walk on Fixed Spheres for Laplace and Lamé equations
• A Randomized Algorithm for Principal Component Analysis
• Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
• On the Early History of the Singular Value Decomposition
• The Fundamental Theorem of Linear Algebra
• Singular Value Decomposition, Eigenfaces, and 3D Reconstructions
• Fast computation of low rank matrix approximations
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Fast monte-carlo algorithms for finding low-rank approximations
• Monte Carlo Methods for Applied Scientists
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Algorithms for Numerical Analysis in High Dimensions
• A principal axis transformation for non-hermitian matrices

This page was built for publication: Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme