Boost logo

Ublas :

From: Nico Galoppo (nico_at_[hidden])
Date: 2007-03-19 14:09:16

Gunther's example implementation is probably a pretty good start for generic
sparse cholesky decomposition:

 From there, depending on how much you know about the structure of your
matrices, you can try to optimize sub-parts with boost::bindings and



Gross, Steve wrote:
> I’ve been reading through the ublas archive, trying to figure out the
> best way to tackle Cholesky factorization. I see that a number of people
> have come up with custom solutions—have any of those solutions been
> integrated into ublas? Obviously, it’s preferable to use the
> functionality if it’s already in the library, rather than cut-and-paste
> someone else’s code as a custom solution.
> Thanks,
> --Steve (sgross_at_[hidden] <mailto:sgross_at_[hidden]>)

nico galoppo von borries     |  address: 119 fidelity st., carrboro
comp. graphics phd. student  |           north carolina, 27510 USA
UNC, chapel hill             |  phone: +1 (919) 962-1898 (office)
                              |         +1 (919) 942-4388 (home)
                              |  email: nico at cs dot unc dot edu
                              |  homepage: