Petter Strandmark 1e3cbd9a44 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
2012-08-30 09:45:20 -07:00
2012-08-02 18:35:16 -07:00
2012-04-30 23:09:08 -07:00
2012-08-29 05:41:22 -07:00
2012-07-19 12:11:32 -07:00
2012-08-20 11:45:04 -07:00
2012-04-30 23:09:08 -07:00
2012-08-14 14:47:13 -07:00

Ceres Solver - A non-linear least squares minimizer
==================================================
Please see ceres-solver.pdf in docs/ for a tutorial and reference.
S
Description
No description provided
Readme Multiple Licenses 42 MiB
Languages
C++ 94.4%
CMake 3.8%
Python 0.8%
C 0.5%
Starlark 0.4%