Re: New Sparse Packages

[Andy Adler]

David,

This sounds like good news. That new code, especially with 64 bit
versions will be a nice advantage to octave. While I agree that
moving to a new package is a little bit of pain. It will be nice
to have all the sparse routines in one package.

Have you yet had time to figure out wither this will change any
of the Sparse class in octave. ie. will those of us who write
sparse code need to plan for any changes?

Thanks
--
Andy Adler <address@hidden> 1(613)562-5800x6218

On Thu, 1 Sep 2005, David Bateman wrote:

> Dear All,
>
> Just for information, I just received the attached e-mail from Tim
> Davis. It describes several developments that are useful for the octave
> sparse toolbox, including better reordering code, and long versions of
> the existing code (ie. support 64 bit), block triangular factorization
> code and new cholesky factorization code. This means that the missing
> symbfact, chol, dmperm functions in the octave sparse code can be
> implemented with this code. It also appears that this is one of the
> fastest sparse cholesky solvers out there.. Tim Davis also supplied mex
> interfaces to his code that is going to make writing the octave code
> much easier...
>
> The downside is that all of his code is now in a single package
> UFSparse, and so this will mean the upstream package of in particular
> UMFPACK will need to be looked into. Additionally UFSparse introduces a
> dependency on the package METIS.
>
> Cheers
> David
>
> --
> David Bateman                                address@hidden
> Motorola Labs - Paris                        +33 1 69 35 48 04 (Ph)
> Parc Les Algorithmes, Commune de St Aubin    +33 1 69 35 77 01 (Fax)
> 91193 Gif-Sur-Yvette FRANCE
>
> The information contained in this communication has been classified as:
>
> [x] General Business Information
> [ ] Motorola Internal Use Only
> [ ] Motorola Confidential Proprietary
>
>