[julia-users] Re: Why does QR beat LU for sparse, square matrices?

[Steven G. Johnson]

I should also mention that the timings can be quite different (probably 
worse) for an sprand matrix than for a matrix that comes from discretizing 
a mesh, even with the same number of nonzeros.    How well sparse-direct 
algorithms work depends a lot on the structure of the sparsity pattern.