Efficiently solving sparse matrices

Posted by anon on Stack Overflow See other posts from Stack Overflow or by anon
Published on 2010-03-03T19:38:56Z Indexed on 2010/03/24 18:53 UTC
Read the original article Hit count: 288

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)?

© Stack Overflow or respective owner

Related posts about numerical

Related posts about algorithm