commit | 1e3cbd9a4442cdd8fda43a7fb452f19dac8c74af | [log] [tgz] |
---|---|---|
author | Petter Strandmark <strandmark@google.com> | Wed Aug 29 09:39:56 2012 -0700 |
committer | Petter Strandmark <strandmark@google.com> | Thu Aug 30 09:45:20 2012 -0700 |
tree | 36bd00a92ef27ab0356f18b93eecac05424a2aa5 | |
parent | 8b64140878ccd1e183d3715c38942a81fdecefde [diff] |
Caching the symbolic Cholesky factorization when using CXSparse Average factorization times for bundle adjustment test problem: SuiteSparse: 0.2794 s. CXSparse: 0.4039 s. CXSparse cached: 0.2399 s. CXSparse will still be slower, though, because it has to compute the transpose and J^T * J. Change-Id: If9cdaa3dd520bee84b56e5fd4953b56a93db6bde