Agreed. This matrix could be decomposed in your browser in javascript ... or these days, on your phone.
-jake On Jul 5, 2011 1:12 AM, "Ted Dunning" <[email protected]> wrote: Lanczos is probably dominated by overhead and startup costs on such a small matrix. You only have 100,000 non-zreo elements which is a truly tiny problem. Stochastic projection SVD, for instance would compute the answer for such a problem in a few milliseconds. You need a much larger problem to show parallel gain. Try 100 x 10^6 non-zeros or more. On Mon, Jul 4, 2011 at 11:27 PM, agnonchik <[email protected]> wrote: > What could be the reason ...
