Is there an existing method for solving sparse triangular systems - taking
advantage of the sparseness and the triangularity?
It seems that with the templated Triangular type taking the matrix type as
well as the element type it should be straightforward to create a
Triangular{Float64,SparseMatrixCSC{Float64},:L,false) type and incorporate
it in a method signature.
I want to avoid reading the code in Csparse or in Tim Davis's book before
writing such a method because that code is GPL'd. Can anyone point me to
general references on sparse matrix methods other than Tim's book "Direct
Methods for Sparse Linear Systems".
