Skip to main content
. Author manuscript; available in PMC: 2014 Nov 20.
Published in final edited form as: SIAM J Sci Comput. 2014;36(2):C95–C118. doi: 10.1137/120866580

Table 5.

Running times (in seconds) on full-rank dense overdetermined problems of size 106 × n, where n ranges from 1000 to 4000. LSRN is slightly slower than CRT 11 when n = 1000 and becomes faster when n = 2000, 3000, and 4000, which is consistent with our theoretical analysis.

n = 1000 n = 2000 n = 3000 n = 4000
CRT11 98.0 327.7 672.3 1147.9
LSRN 101.1 293.1 594.0 952.2