Fetching the paper…
Reading the bibliography…
We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \in \mathbb{R}^n$.
G. E. Forsythe and R. A. Leibler, “Matrix inversion by a monte carlo method,” Mathematical Tables and Other Aids to Computation , pp. 127–129, 1950
1950
Earlier work this paper cites.
W. Wasow, “A note on the inversion of matrices by random walks,” Mathematical Tables and Other Aids to Computation , pp. 78–81, 1952
1952
Earlier work this paper cites.
J. Curtiss, A theoretical comparison of the efficiencies of two classical methods and a monte carlo method for computing one component of the solution of a set of linear algebraic equations . Courant Institute of Mathematical Sciences, New York University, 1954
1954
Earlier work this paper cites.
J. R. Westlake, A handbook of numerical matrix inversion and solution of linear equations . Wiley New York, 1968, vol. 767
1968
Earlier work this paper cites.
J. H. Halton, “A retrospective and prospective survey of the monte carlo method,” Siam review , vol. 12, no. 1, pp. 1–63, 1970
1970
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Prentice-Hall, Inc., 1989
1989
Earlier work this paper cites.
——, “Sequential monte carlo techniques for the solution of linear systems,” Journal of Scientific Computing , vol. 9, no. 2, pp. 213–257, 1994
1994
Earlier work this paper cites.
D. Borthakur, “The hadoop distributed file system: Architecture and design,” Hadoop Project Website , vol. 11, no. 2007, p. 21, 2007
2007
Earlier work this paper cites.
R. Andersen, C. Borgs, J. Chayes, J. Hopcraft, V. S. Mirrokni, and S.-H. Teng, “Local computation of PageRank contributions,” in Algorithms and Models for the Web-Graph . Springer, 2007, pp. 150–165
2007
Earlier work this paper cites.
J. Dean and S. Ghemawat, “Mapreduce: simplified data processing on large clusters,” Communications of the ACM , vol. 51, no. 1, pp. 107–113, 2008
2008
Earlier work this paper cites.
T. Strohmer and R. Vershynin, “A randomized kaczmarz algorithm with exponential convergence,” Journal of Fourier Analysis and Applications , vol. 15, no. 2, pp. 262–278, 2009
2009
Earlier work this paper cites.
K. Sabelfeld and N. Mozartova, “Sparsified randomization algorithms for large systems of linear equations and a new version of the random walk on boundary method,” Monte Carlo Methods and Applications , vol. 15, no. 3, pp. 257–284, 2009
2009
Cited alongside, same era.
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: Cluster computing with working sets.” HotCloud , vol. 10, no. 10-10, p. 95, 2010
2010
Cited alongside, same era.
K. Sabelfeld and N. Loshchina, “Stochastic iterative projection methods for large linear systems,” Monte Carlo Methods and Applications , vol. 16, no. 3-4, pp. 343–359, 2010
2010
Cited alongside, same era.
I. Koutis, G. L. Miller, and R. Peng, “A nearly-m log n time solver for sdd linear systems,” in Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on . IEEE, 2011, pp. 590–598
2011
Cited alongside, same era.
C. E. Lee, A. Ozdaglar, and D. Shah, “Computing the stationary distribution locally,” in Advances in Neural Information Processing Systems 26 , C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Weinberger, Eds. Curran Associates, Inc., 2013, pp. 1376–1384. [Online]. Available: http://papers.nips.cc/paper/5009-computing-the-stationary-distribution-locally.pdf
2013
Later among the works it cites.
M. Wang and D. P. Bertsekas, “Stabilization of stochastic iterative methods for singular and nearly singular linear systems,” Mathematics of Operations Research , vol. 39, no. 1, pp. 1–30, 2013
2013
Later among the works it cites.
D. A. Spielman and S.-H. Teng, “Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems,” SIAM Journal on Matrix Analysis and Applications , vol. 35, no. 3, pp. 835–885, 2014
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Sabelfeld, “Stochastic algorithms in linear algebra-beyond the markov chains and von neumann-ulam scheme,” in Numerical Methods and Applications . Springer, 2011, pp. 14–28
2011
Cited alongside, same era.
G. H. Golub and C. F. Van Loan, Matrix computations / Gene H. Golub, Charles F. Van Loan. , ser. Johns Hopkins studies in the mathematical sciences. Baltimore : The Johns Hopkins University Press, 2013., 2013
2013
Cited alongside, same era.
J. A. Kelner, L. Orecchia, A. Sidford, and Z. A. Zhu, “A simple, combinatorial algorithm for solving sdd systems in nearly-linear time,” in Proceedings of the forty-fifth annual ACM symposium on Theory of computing . ACM, 2013, pp. 911–920
2013
Cited alongside, same era.
N. K. Vishnoi et al. , “Lx= b, laplacian solvers and their algorithmic applications,” Foundations and Trends® in Theoretical Computer Science , vol. 8, no. 1–2, pp. 1–141, 2013
2013
Cited alongside, same era.
J. Liu, S. Mou, and A. S. Morse, “An asynchronous distributed algorithm for solving a linear algebraic equation,” in Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on . IEEE, 2013, pp. 5409–5414
2013
Cited alongside, same era.
H. Ji, M. Mascagni, and Y. Li, “Convergence analysis of markov chain monte carlo linear solvers using ulam–von neumann algorithm,” SIAM Journal on Numerical Analysis , vol. 51, no. 4, pp. 2107–2122, 2013
2013
Cited alongside, same era.
2014
Closest in time.
S. J. Wright, “Coordinate descent algorithms,” Mathematical Programming , vol. 151, no. 1, pp. 3–34, 2015
2015
Closest in time.
S. Mou, J. Liu, and A. S. Morse, “A distributed algorithm for solving a linear algebraic equation,” IEEE Transactions on Automatic Control , vol. 60, no. 11, pp. 2863–2878, 2015
2015
Closest in time.
I. Dimov, S. Maire, and J. M. Sellier, “A new walk on equations monte carlo method for solving systems of linear algebraic equations,” Applied Mathematical Modelling , vol. 39, no. 15, pp. 4494–4510, 2015
2015
Closest in time.
D. F. Gleich and K. Kloster, “Sublinear column-wise actions of the matrix exponential on social networks,” Internet Mathematics , vol. 11, no. 4-5, pp. 352–384, 2015
2015
Closest in time.
J. Nutini, M. Schmidt, I. H. Laradji, M. Friedlander, and H. Koepke, “Coordinate descent converges faster with the gauss-southwell rule than random selection,” in Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 , ser. ICML’15. JMLR.org, 2015, pp. 1632–1641. [Online]. Available: http://dl.acm.org/citation.cfm?id=3045118.3045292
2015
Closest in time.
N. Shyamkumar, S. Banerjee, and P. Lofgren, “Sublinear estimation of a single element in sparse linear systems,” in Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton Conference on . IEEE, 2016, pp. 856–860
2016
Closest in time.