mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-29 16:40:38 +08:00
1635ce726078f00264b89d7fb6e76fd1c2796e59
When the user provides an ordering which starts at a non-zero group id, or has gaps in the groups, then CAMD, the algorithm used to reorder the program can crash or return garbage results. The solution is to map the ordering into grouping constraints, and then to re-number the groups to be contiguous using a call to MapValuesToContiguousRange. This was already done for CAMD based ordering for Schur type solvers, but was not done for SPARSE_NORMAL_CHOLESKY. Thanks to Bernhard Zeisl for not only reporting the bug but also providing a reproduction. Change-Id: I5cfae222d701dfdb8e1bda7f0b4670a30417aa89
Ceres Solver - A non-linear least squares minimizer
Please see ceres-solver.org for more information.
WARNING - Do not make GitHub pull requests!
Ceres development happens on Gerrit, including both repository hosting and code reviews. The GitHub Repository is a continuously updated mirror which is primarily meant for issue tracking. Please see our Contributing to Ceres Guide for more details.
The upstream Gerrit repository is
https://ceres-solver.googlesource.com/ceres-solver
Description
Languages
C++
94.4%
CMake
3.8%
Python
0.8%
C
0.5%
Starlark
0.4%