期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 34, 期 2, 页码 773-793出版社
SIAM PUBLICATIONS
DOI: 10.1137/120889897
关键词
linear least squares; minimum-length solution; sparse matrix; overdetermined system; underdetermined system; iterative method; random sampling; LAPACK; randomized algorithms
资金
- Qualcomm Inc.
We 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据