Re: Sparse LU Decomposition

We did do some initial prototypes of direct sparse solvers.  The 
challenge in creating a solver similar to SuperLU is that the structure 
of the matrix must be able to accommodate variable-sized dense blocks.  
If you are interested in writing such an algorithm, we can probably 
lend a hand.

Related to this, we also have some fill-reducing sparse matrix ordering 
algorithms as part of the Boost Graph Library (www.boost.org), which 
you may also find useful.

On Thursday, August 28, 2003, at 08:12 AM, Björn Selent wrote:

> Hallo people,
> I am a rather new user of the MTL/ITL template libraries and they 
> confirmed
> very useful for my project. Unfortunately it would be the handiest for 
> my
> Finite Element calculations to have a Sparse Matrix LU-Decomposition
> algorithm similar to UMFPACK or SuperLU. My question is if somebody is 
> maybe
> already working on such a routine in MTL classification. It is an 
> aweful lot
> of work but I think it would be great to have such a solver. So I 
> would give
> it a try to write it on my own but I'd appreciate any help I could get.
> Cheers
> Bjoern
> -- 
>
> _______________________________________________
> This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/

_______________________________________________
This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/