Re: Sparse LU Decomposition

hello,
thanks for the quick reply. Do you mind to send me the source code for direct 
solvers you have so far?
Bjoern

On Thursday 28 Aug 2003 2:17 pm, Andrew Lumsdaine wrote:
> 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.
>

-- 
In Dublin's fair city where girls are so pretty
Twas there that I first met sweet Molly Malone
As she wheeled her wheelbarrow
Through street broad and narrow
Crying, "Cockles and mussels, alive, alive oh"
_______________________________________________
This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/