暂无分享,去创建一个
[1] Sivan Toledo,et al. Blendenpik: Supercharging LAPACK's Least-Squares Solver , 2010, SIAM J. Sci. Comput..
[2] Vincent Nesme,et al. Note on sampling without replacing from a finite collection of matrices , 2010, ArXiv.
[3] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[4] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[5] Michael A. Saunders,et al. LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems , 2011, SIAM J. Sci. Comput..
[6] Ilse C. F. Ipsen,et al. The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems , 2014, SIAM J. Matrix Anal. Appl..
[7] R. Welsch,et al. The Hat Matrix in Regression and ANOVA , 1978 .
[8] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[9] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[10] Alex Gittens,et al. TAIL BOUNDS FOR ALL EIGENVALUES OF A SUM OF RANDOM MATRICES , 2011, 1104.4513.
[11] Robert W. Heath,et al. Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum , 2005, SIAM J. Matrix Anal. Appl..
[12] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication , 2006, SIAM J. Comput..
[13] S. Muthukrishnan,et al. Faster least squares approximation , 2007, Numerische Mathematik.