On Aug 12, 2010, at 4:17 PM, Matthew Knepley wrote:
> On Thu, Aug 12, 2010 at 4:10 PM, Barry Smith
> wrote:
>
> It claims "permute the matrix such that sparse matrix-vector
> multiplication
>
> Does anyone understand what this means? I understand cache-oblivious
> divide&conquer
> where
On Thu, Aug 12, 2010 at 4:10 PM, Barry Smith wrote:
>
> It claims "permute the matrix such that sparse matrix-vector
> multiplication
>
Does anyone understand what this means? I understand cache-oblivious
divide&conquer
where you just keep splitting until you are in cache (the original paper b
Prob will not help that much over Metis for MatMult, but fill-reducing
orderings
might be a big win for LU.
Matt
On Thu, Aug 12, 2010 at 1:38 PM, Barry Smith wrote:
>
> From: Bas Fagginger Auer
> Date: Wed, 4 Aug 2010 15:02:44 +0200
> Subject: Mondriaan 3.0 : Sparse Matrix Partitioning Pack
It claims "permute the matrix such that sparse matrix-vector multiplication
>
> is cache-oblivious," this would be a great feature to have it worked.
Barry
On Aug 12, 2010, at 3:07 PM, Matthew Knepley wrote:
> Prob will not help that much over Metis for MatMult, but fill-reducing
> or
From: Bas Fagginger Auer
Date: Wed, 4 Aug 2010 15:02:44 +0200
Subject: Mondriaan 3.0 : Sparse Matrix Partitioning Package
Mondriaan 3.0: Sparse matrix partitioning package
We would like to announce the availability of version 3.0 of the
Mondriaan package. Mondriaan can be used as a preprocessin
