Boost logo

Ublas :

From: Gunter Winkler (guwi17_at_[hidden])
Date: 2007-03-02 09:47:36

On Friday 02 March 2007 15:12, Karl Meerbergen wrote:
> It should be possible to do this with the triangular solves from ublas
> but I am unsure whether they efficiently handle sparse matrices. Gunter,
> what about the new routines?

I have specializations for compressed_matrix. They are hopefully as fast as
possible ;-)

  template < bool unit, class T, class Z, class D, size_t IB, class IA,
             class TA, class VEC >
    const compressed_matrix<T, basic_row_major<Z,D>, IB, IA, TA>& L,
    vector_expression<VEC>& ve)


PS: Is anyone out there who can grant CVS write access to me?