Exploiting sparse matrices for speed

[Joza]

In light of another thread I had, I thought it might be good to start a more
general discussion on the topic. As I stated in the other thread, I had a
1000x1000 sparse matrix with 2 on the main-diagonal, and -1 and the upper
and lower sub diagonal. All other entries were zero. Using a Successive
Over-Relaxation method to solve this took FOREVER in my opinion....to my
desired accuracy, hours.

Surely there are ways of exploiting such massive sparsity for faster
algorithms! I'd be shocked if there weren't  

So, what are the general methods? I'd love to learn some new tricks!



--
View this message in context: 
http://octave.1599824.n4.nabble.com/Exploiting-sparse-matrices-for-speed-tp4646138.html
Sent from the Octave - General mailing list archive at Nabble.com.