Add end-to-end BA tests for SCHUR_POWER_SERIES_EXPANSION

Also tighten the value of eta to make the iterative schur
solvers work better. This is the default value used in
bundle_adjuster.cc

Fixes https://github.com/ceres-solver/ceres-solver/issues/864
Change-Id: I48258fbbe256d6e932aaea0078b566fcd63de2fb

Change-Id: Ia5ad252cae31f415a47495fb8769421ade355bc9
This commit is contained in:
Sameer Agarwal
2023-09-28 09:49:03 -07:00
parent 83ee376d86
commit 41672dff8c
74 changed files with 316 additions and 1 deletions
@@ -62,6 +62,7 @@ ITERATIVE_SOLVER_CONFIGS = [
# Linear solver Sparse backend Preconditioner
('ITERATIVE_SCHUR', 'NO_SPARSE', 'JACOBI'),
('ITERATIVE_SCHUR', 'NO_SPARSE', 'SCHUR_JACOBI'),
('ITERATIVE_SCHUR', 'NO_SPARSE', 'SCHUR_POWER_SERIES_EXPANSION'),
('ITERATIVE_SCHUR', 'SUITE_SPARSE', 'CLUSTER_JACOBI'),
('ITERATIVE_SCHUR', 'EIGEN_SPARSE', 'CLUSTER_JACOBI'),
('ITERATIVE_SCHUR', 'ACCELERATE_SPARSE','CLUSTER_JACOBI'),
@@ -87,6 +88,7 @@ FILENAME_SHORTENING_MAP = dict(
SCHUR_JACOBI='schurjacobi',
CLUSTER_JACOBI='clustjacobi',
CLUSTER_TRIDIAGONAL='clusttri',
SCHUR_POWER_SERIES_EXPANSION='spse',
kAutomaticOrdering='auto',
kUserOrdering='user',
)
@@ -140,6 +142,7 @@ TEST_F(BundleAdjustmentTest,
%(test_class_name)s) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = %(num_threads)s;
options->linear_solver_type = %(linear_solver)s;
options->dense_linear_algebra_library_type = %(dense_backend)s;
@@ -1,5 +1,5 @@
# Ceres Solver - A fast non-linear least squares minimizer
# Copyright 2022 Google Inc. All rights reserved.
# Copyright 2023 Google Inc. All rights reserved.
# http://ceres-solver.org/
#
# Redistribution and use in source and binary forms, with or without
@@ -46,6 +46,7 @@ ceres_test(ba_sparseschur_eigensparse_auto)
ceres_test(ba_sparseschur_acceleratesparse_auto)
ceres_test(ba_iterschur_jacobi_auto)
ceres_test(ba_iterschur_schurjacobi_auto)
ceres_test(ba_iterschur_spse_auto)
ceres_test(ba_iterschur_suitesparse_clustjacobi_auto)
ceres_test(ba_iterschur_eigensparse_clustjacobi_auto)
ceres_test(ba_iterschur_acceleratesparse_clustjacobi_auto)
@@ -63,6 +64,7 @@ ceres_test(ba_sparseschur_eigensparse_auto_threads)
ceres_test(ba_sparseschur_acceleratesparse_auto_threads)
ceres_test(ba_iterschur_jacobi_auto_threads)
ceres_test(ba_iterschur_schurjacobi_auto_threads)
ceres_test(ba_iterschur_spse_auto_threads)
ceres_test(ba_iterschur_suitesparse_clustjacobi_auto_threads)
ceres_test(ba_iterschur_eigensparse_clustjacobi_auto_threads)
ceres_test(ba_iterschur_acceleratesparse_clustjacobi_auto_threads)
@@ -80,6 +82,7 @@ ceres_test(ba_sparseschur_eigensparse_user)
ceres_test(ba_sparseschur_acceleratesparse_user)
ceres_test(ba_iterschur_jacobi_user)
ceres_test(ba_iterschur_schurjacobi_user)
ceres_test(ba_iterschur_spse_user)
ceres_test(ba_iterschur_suitesparse_clustjacobi_user)
ceres_test(ba_iterschur_eigensparse_clustjacobi_user)
ceres_test(ba_iterschur_acceleratesparse_clustjacobi_user)
@@ -97,6 +100,7 @@ ceres_test(ba_sparseschur_eigensparse_user_threads)
ceres_test(ba_sparseschur_acceleratesparse_user_threads)
ceres_test(ba_iterschur_jacobi_user_threads)
ceres_test(ba_iterschur_schurjacobi_user_threads)
ceres_test(ba_iterschur_spse_user_threads)
ceres_test(ba_iterschur_suitesparse_clustjacobi_user_threads)
ceres_test(ba_iterschur_eigensparse_clustjacobi_user_threads)
ceres_test(ba_iterschur_acceleratesparse_clustjacobi_user_threads)
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Cuda_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = CUDA;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Cuda_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = CUDA;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Cuda_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = CUDA;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Cuda_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = CUDA;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Eigen_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Eigen_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Eigen_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Eigen_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Lapack_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = LAPACK;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Lapack_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = LAPACK;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Lapack_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = LAPACK;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
DenseSchur_Lapack_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = DENSE_SCHUR;
options->dense_linear_algebra_library_type = LAPACK;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterJacobi_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterJacobi_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterJacobi_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterJacobi_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterTridiagonal_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterTridiagonal_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterTridiagonal_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_AccelerateSparse_ClusterTridiagonal_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterJacobi_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterJacobi_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterJacobi_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterJacobi_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterTridiagonal_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterTridiagonal_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterTridiagonal_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_EigenSparse_ClusterTridiagonal_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_Jacobi_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_Jacobi_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_Jacobi_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_Jacobi_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurJacobi_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurJacobi_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurJacobi_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -44,6 +44,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurJacobi_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -0,0 +1,60 @@
// Ceres Solver - A fast non-linear least squares minimizer
// Copyright 2023 Google Inc. All rights reserved.
// http://ceres-solver.org/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Google Inc. nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// ========================================
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// ========================================
//
// This file is generated using generate_bundle_adjustment_tests.py.
#include "ceres/internal/config.h"
#include "bundle_adjustment_test_util.h"
namespace ceres::internal {
TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurPowerSeriesExpansion_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
options->sparse_linear_algebra_library_type = NO_SPARSE;
options->preconditioner_type = SCHUR_POWER_SERIES_EXPANSION;
if (kAutomaticOrdering) {
options->linear_solver_ordering = nullptr;
}
Problem* problem = bundle_adjustment_problem.mutable_problem();
RunSolverForConfigAndExpectResidualsMatch(*options, problem);
}
} // namespace ceres::internal
@@ -0,0 +1,60 @@
// Ceres Solver - A fast non-linear least squares minimizer
// Copyright 2023 Google Inc. All rights reserved.
// http://ceres-solver.org/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Google Inc. nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// ========================================
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// ========================================
//
// This file is generated using generate_bundle_adjustment_tests.py.
#include "ceres/internal/config.h"
#include "bundle_adjustment_test_util.h"
namespace ceres::internal {
TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurPowerSeriesExpansion_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
options->sparse_linear_algebra_library_type = NO_SPARSE;
options->preconditioner_type = SCHUR_POWER_SERIES_EXPANSION;
if (kAutomaticOrdering) {
options->linear_solver_ordering = nullptr;
}
Problem* problem = bundle_adjustment_problem.mutable_problem();
RunSolverForConfigAndExpectResidualsMatch(*options, problem);
}
} // namespace ceres::internal
@@ -0,0 +1,60 @@
// Ceres Solver - A fast non-linear least squares minimizer
// Copyright 2023 Google Inc. All rights reserved.
// http://ceres-solver.org/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Google Inc. nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// ========================================
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// ========================================
//
// This file is generated using generate_bundle_adjustment_tests.py.
#include "ceres/internal/config.h"
#include "bundle_adjustment_test_util.h"
namespace ceres::internal {
TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurPowerSeriesExpansion_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
options->sparse_linear_algebra_library_type = NO_SPARSE;
options->preconditioner_type = SCHUR_POWER_SERIES_EXPANSION;
if (kUserOrdering) {
options->linear_solver_ordering = nullptr;
}
Problem* problem = bundle_adjustment_problem.mutable_problem();
RunSolverForConfigAndExpectResidualsMatch(*options, problem);
}
} // namespace ceres::internal
@@ -0,0 +1,60 @@
// Ceres Solver - A fast non-linear least squares minimizer
// Copyright 2023 Google Inc. All rights reserved.
// http://ceres-solver.org/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Google Inc. nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// ========================================
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// THIS FILE IS AUTOGENERATED. DO NOT EDIT.
// ========================================
//
// This file is generated using generate_bundle_adjustment_tests.py.
#include "ceres/internal/config.h"
#include "bundle_adjustment_test_util.h"
namespace ceres::internal {
TEST_F(BundleAdjustmentTest,
IterativeSchur_SchurPowerSeriesExpansion_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
options->sparse_linear_algebra_library_type = NO_SPARSE;
options->preconditioner_type = SCHUR_POWER_SERIES_EXPANSION;
if (kUserOrdering) {
options->linear_solver_ordering = nullptr;
}
Problem* problem = bundle_adjustment_problem.mutable_problem();
RunSolverForConfigAndExpectResidualsMatch(*options, problem);
}
} // namespace ceres::internal
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterJacobi_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterJacobi_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterJacobi_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterJacobi_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterTridiagonal_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterTridiagonal_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterTridiagonal_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
IterativeSchur_SuiteSparse_ClusterTridiagonal_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = ITERATIVE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_AccelerateSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_AccelerateSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_AccelerateSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_AccelerateSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_EigenSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_EigenSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_EigenSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_EigenSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_SuiteSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_SuiteSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_SuiteSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseNormalCholesky_SuiteSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_NORMAL_CHOLESKY;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_AccelerateSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_AccelerateSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_AccelerateSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_AccelerateSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_EigenSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_EigenSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_EigenSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_EigenSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_SuiteSparse_AutomaticOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_SuiteSparse_AutomaticOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_SuiteSparse_UserOrdering) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 1;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;
@@ -46,6 +46,7 @@ TEST_F(BundleAdjustmentTest,
SparseSchur_SuiteSparse_UserOrdering_Threads) { // NOLINT
BundleAdjustmentProblem bundle_adjustment_problem;
Solver::Options* options = bundle_adjustment_problem.mutable_solver_options();
options->eta = 0.01;
options->num_threads = 4;
options->linear_solver_type = SPARSE_SCHUR;
options->dense_linear_algebra_library_type = EIGEN;