暂无分享,去创建一个
[1] Ilse C. F. Ipsen,et al. Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds , 2015, SIAM J. Matrix Anal. Appl..
[2] N. Polydorides,et al. A row-sampling-based randomised finite element method for elliptic partial differential equations. , 2019 .
[3] Nikhil Srivastava,et al. Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..
[4] Tamás Sarlós,et al. Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[5] Michael W. Mahoney. Lecture Notes on Randomized Linear Algebra , 2016, ArXiv.
[6] Petros Drineas,et al. Fast Monte-Carlo algorithms for approximate matrix multiplication , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] N. Polydorides,et al. A randomised finite element method for elliptic partial differential equations , 2019, 1903.07696.
[8] Patrick J. Wolfe,et al. On sparse representations of linear operators and the approximation of matrix products , 2007, 2008 42nd Annual Conference on Information Sciences and Systems.
[9] Edith Cohen,et al. Approximating matrix multiplication for pattern recognition tasks , 1997, SODA '97.
[10] S. Muthukrishnan,et al. Sampling algorithms for l2 regression and applications , 2006, SODA '06.
[11] Ilse C. F. Ipsen,et al. Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval , 2011, SIAM J. Sci. Comput..
[12] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication , 2006, SIAM J. Comput..
[13] Dimitri P. Bertsekas,et al. Error Bounds for Approximations from Projected Linear Equations , 2010, Math. Oper. Res..
[14] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .