commit | ba65ddd311239c26dd8950ab37f504d37bf6fa44 | [log] [tgz] |
---|---|---|
author | Sameer Agarwal <sameeragarwal@google.com> | Sat Aug 27 07:49:35 2022 +0530 |
committer | Sameer Agarwal <sameeragarwal@google.com> | Sun Aug 28 07:20:53 2022 +0300 |
tree | 84cfab577c7e224fd6a6f3a5bb997fd5ad7e4f11 | |
parent | 42352e2e2a046673cc21e6c884817f5040899e6a [diff] |
Improvements to benchmarks 1. Add CreateFakeBundleAdjustmentJacobian to create bundle adjustment structured jacobians. 2. sparse_linear_operator_benchmark -> spmv_benchmark 3. Refactor spmv_benchmark to use CreateFakeBundleAdjustmentJacobian. 4. Add BA and unstructured Jacobian variants of spmv benchmarks 5. Add BA and unstructured Jacobian benchmarks for the block Jacobi preconditioner. 6. Fix BlockSparseMatrix::ToCompressedRowSparseMatrix to add the row and column block structure to the output. Change-Id: I737a3d7d82dad665b1f2e7886c2c3aedd702ffcd
Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It is a feature rich, mature and performant library which has been used in production at Google since 2010. Ceres Solver can solve two kinds of problems.
Please see ceres-solver.org for more information.