Efficiently solving sparse matrices
- by anon
For solving spare matrices,
in general, how big does the matrix have to be (as a rule of thumb)
for methods like congraduate descent to be faster than brute force solvers (that do not take advantage o sparsity)?