/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils.h | 66 // R * solution = rhs 87 // R' * solution = rhs 122 double* solution) { 123 fill(solution, solution + num_cols, 0.0); 124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1]; 131 solution[c] -= v * solution[r]; 133 solution[c] = solution[ 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument [all...] |
H A D | implicit_schur_complement_test.cc | 74 Vector* solution) { 108 solution->resize(num_cols_); 109 solution->setZero(); 110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows, 114 schur_solution.data(), solution->data()); 160 // Reference solution to the f_block. 164 // Backsubstituted solution from the implicit schur solver using the 165 // reference solution to the f_block. 71 ReducedLinearSystemAndSolution(double* D, Matrix* lhs, Vector* rhs, Vector* solution) argument
|
H A D | compressed_col_sparse_matrix_utils_test.cc | 264 double solution[4]; local 276 solution); 278 EXPECT_NEAR(solution[j], expected[4 * i + j], 1e-3) << i;
|
H A D | schur_complement_solver.cc | 118 DenseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { argument 148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows)); 150 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); 154 solution, 252 SparseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { argument 255 return SolveReducedLinearSystemUsingSuiteSparse(solution); 257 return SolveReducedLinearSystemUsingCXSparse(solution); 259 return SolveReducedLinearSystemUsingEigen(solution); 273 double* solution) { 368 VectorRef(solution, num_row 272 SolveReducedLinearSystemUsingSuiteSparse( double* solution) argument 379 SolveReducedLinearSystemUsingCXSparse( double* solution) argument 435 SolveReducedLinearSystemUsingEigen( double* solution) argument [all...] |
H A D | line_search.cc | 346 FunctionSample solution, bracket_low, bracket_high; local 418 &solution, 419 summary) && !solution.value_is_valid) { 429 solution = 430 solution.value_is_valid && solution.value <= bracket_low.value 431 ? solution : bracket_low; 433 summary->optimal_step_size = solution.x; 637 // Returns true iff solution satisfies the strong Wolfe conditions. Otherwise, 639 // reaching max_num_iterations, solution i 641 ZoomPhase(const FunctionSample& initial_position, FunctionSample bracket_low, FunctionSample bracket_high, FunctionSample* solution, Summary* summary) argument [all...] |
H A D | visibility_based_preconditioner.cc | 468 cholmod_dense* solution = local 470 memcpy(y, solution->x, sizeof(*y) * num_rows); 471 ss->Free(solution);
|
H A D | covariance_impl.cc | 514 // is given by the solution to the linear system 539 double* solution = workspace.get() + thread_id * num_cols; local 546 solution); 549 values[idx] = solution[inverse_permutation[c]]; 702 // is given by the solution to the linear system 728 double* solution = workspace.get() + thread_id * num_cols; local 735 solution); 741 values[idx] = solution[inverse_permutation.indices().coeff(c)];
|
/external/ceres-solver/examples/ |
H A D | denoising.cc | 92 PGMImage<double>* solution) { 102 solution->MutablePixelFromLinearIndex(index)); 122 double* pixel = solution->MutablePixel(x + x_delta_indices[i], 138 // solution stays within [0, 255]. 139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { argument 162 // Make the solution stay in [0, 255]. 163 for (int x = 0; x < solution->width(); ++x) { 164 for (int y = 0; y < solution->height(); ++y) { 165 *solution->MutablePixel(x, y) = 166 std::min(255.0, std::max(0.0, solution 89 CreateProblem(const FieldsOfExperts& foe, const PGMImage<double>& image, Problem* problem, PGMImage<double>* solution) argument [all...] |
/external/opencv/cvaux/src/ |
H A D | cvlmeds.cpp | 678 double solution[9]; local 747 { /* ----------- computing the solution ----------- */ 781 /* ----------- solution = V * W(-1) * U(T) * f ----------- */ 787 solution[a] = 0; 791 solution[a] += temp2[a_num + t] * f[t]; 801 solution[a] = solution[a - 1]; 804 solution[a] = 1; 816 summ += A[a9 + t] * solution[t]; 828 F[j] = solution[ [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |