.png){kind=icon}
.png){kind=icon}
Return
A fast randomized algorithm for overdetermined linear least-squares regression
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.0804869105.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a randomized algorithm for overdetermined linear least-squares regression. Given an arbitrary full-rank m x n matrix A with m >= n, any m x 1 vector b, and any positive real number 6, the procedure computes an n x 1 vector x such that x minimizes the Euclidean norm parallel to Ax - b parallel to to relative precision epsilon. The algorithm typically requires O((log(n) + log(1/epsilon))mn + n(3)) floating-point operations. This cost is less than the O(mn(2)) required by the classical schemes based on QR-decompositions or bidiagonalization. We present several numerical examples illustrating the performance of the algorithm.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
9.1
Papers:
10.8W
Citations:
73.5W