Zouzias, AnastasiosFreris, Nikolaos M.2013-10-012013-10-012013-10-01201310.1137/120889897https://infoscience.epfl.ch/handle/20.500.14299/95936WOS:000321043700023We present a randomized iterative algorithm that exponentially converges in the mean square to the minimum l(2)-norm least squares solution of a given linear system of equations. The expected number of arithmetic operations required to obtain an estimate of given accuracy is proportional to the squared condition number of the system multiplied by the number of nonzero entries of the input matrix. The proposed algorithm is an extension of the randomized Kaczmarz method that was analyzed by Strohmer and Vershynin.linear least squaresminimum-length solutionsparse matrixoverdetermined systemunderdetermined systemiterative methodrandom samplingLAPACKrandomized algorithmstext::journal::journal article::research article