Searched refs:kEpsilon (Results 1 – 7 of 7) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | polynomial_solver_test.cc | 45 const double kEpsilon = 1e-13; variable
141 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
146 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
151 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
156 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
161 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
180 ExpectClose(real(0), 42.42, kEpsilon); in TEST()
181 ExpectClose(real(1), 42.42, kEpsilon); in TEST()
182 ExpectClose(std::abs(imag(0)), 4.2, kEpsilon); in TEST()
183 ExpectClose(std::abs(imag(1)), 4.2, kEpsilon); in TEST()
[all …]
|
| D | partitioned_matrix_view_test.cc | 47 const double kEpsilon = 1e-14; variable
101 EXPECT_NEAR(y1(i), y2(i), kEpsilon); in TEST_F()
126 EXPECT_NEAR(y1(i), y2(i), kEpsilon); in TEST_F()
152 kEpsilon); in TEST_F()
169 EXPECT_NEAR(block_diagonal_ee->values()[0], 10.0, kEpsilon); in TEST_F()
170 EXPECT_NEAR(block_diagonal_ee->values()[1], 155.0, kEpsilon); in TEST_F()
185 EXPECT_NEAR(block_diagonal_ff->values()[0], 70.0, kEpsilon); in TEST_F()
186 EXPECT_NEAR(block_diagonal_ff->values()[1], 17.0, kEpsilon); in TEST_F()
187 EXPECT_NEAR(block_diagonal_ff->values()[2], 37.0, kEpsilon); in TEST_F()
|
| D | iterative_schur_complement_solver_test.cc | 57 const double kEpsilon = 1e-14; variable
100 if (diff < kEpsilon) { in TestSolver()
105 << " solution by " << diff << " which is more than " << kEpsilon; in TestSolver()
|
| D | implicit_schur_complement_test.cc | 53 const double kEpsilon = 1e-14; variable
141 if ((y - z).norm() > kEpsilon) { in TestImplicitSchurComplement()
150 if ((isc.rhs() - rhs).norm() > kEpsilon) { in TestImplicitSchurComplement()
165 if ((sol - reference_solution).norm() > kEpsilon) { in TestImplicitSchurComplement()
|
| D | dogleg_strategy_test.cc | 122 const double kEpsilon = std::numeric_limits<double>::epsilon(); variable
148 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon)); in TEST_F()
168 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon)); in TEST_F()
|
| D | trust_region_minimizer.cc | 58 const double kEpsilon = 1e-12; variable
186 max(iteration_summary.gradient_max_norm, kEpsilon); in Minimize()
|
| D | conjugate_gradients_solver.cc | 59 const double kEpsilon = 2.2204e-16; variable
|