Searched refs:rhs_and_solution (Results 1 – 7 of 7) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | compressed_col_sparse_matrix_utils.h | 74 double* rhs_and_solution) { in SolveUpperTriangularInPlace() argument
76 rhs_and_solution[c] /= values[cols[c + 1] - 1]; in SolveUpperTriangularInPlace()
80 rhs_and_solution[r] -= v * rhs_and_solution[c]; in SolveUpperTriangularInPlace()
95 double* rhs_and_solution) { in SolveUpperTriangularTransposeInPlace() argument
100 rhs_and_solution[c] -= v * rhs_and_solution[r]; in SolveUpperTriangularTransposeInPlace()
102 rhs_and_solution[c] = rhs_and_solution[c] / values[cols[c + 1] - 1]; in SolveUpperTriangularTransposeInPlace()
|
| D | sparse_normal_cholesky_solver.cc | 128 double * rhs_and_solution) { in SolveImplUsingEigen() argument
181 const Vector b = VectorRef(rhs_and_solution, outer_product_->num_rows()); in SolveImplUsingEigen()
206 VectorRef(rhs_and_solution, outer_product_->num_rows()) = in SolveImplUsingEigen()
225 double * rhs_and_solution) { in SolveImplUsingCXSparse() argument
294 } else if (!cxsparse_.SolveCholesky(AtA, cxsparse_factor_, rhs_and_solution)) { in SolveImplUsingCXSparse()
307 double * rhs_and_solution) { in SolveImplUsingSuiteSparse() argument
362 cholmod_dense* rhs = ss_.CreateDenseVector(rhs_and_solution, num_cols, num_cols); in SolveImplUsingSuiteSparse()
368 memcpy(rhs_and_solution, solution->x, num_cols * sizeof(*rhs_and_solution)); in SolveImplUsingSuiteSparse()
|
| D | lapack.cc | 72 double* rhs_and_solution, in SolveInPlaceUsingCholesky() argument
101 dpotrs_(&uplo, &n, &nrhs, lhs, &n, rhs_and_solution, &n, &info); in SolveInPlaceUsingCholesky()
153 double* rhs_and_solution, in SolveInPlaceUsingQR() argument
174 rhs_and_solution, in SolveInPlaceUsingQR()
|
| D | compressed_col_sparse_matrix_utils_test.cc | 234 double rhs_and_solution[] = {1.0, 1.0, 2.0, 2.0}; in TEST_F() local
241 rhs_and_solution); in TEST_F()
244 EXPECT_NEAR(rhs_and_solution[i], expected[i], 1e-4) << i; in TEST_F()
249 double rhs_and_solution[] = {1.0, 1.0, 2.0, 2.0}; in TEST_F() local
256 rhs_and_solution); in TEST_F()
259 EXPECT_NEAR(rhs_and_solution[i], expected[i], 1e-4) << i; in TEST_F()
|
| D | sparse_normal_cholesky_solver.h | 71 double* rhs_and_solution);
77 double* rhs_and_solution);
83 double* rhs_and_solution);
|
| D | lapack.h | 60 double* rhs_and_solution,
93 double* rhs_and_solution,
|
| D | compressed_row_sparse_matrix_test.cc | 316 double rhs_and_solution[] = {1.0, 1.0, 2.0, 2.0}; in TEST_F() local
318 matrix_->SolveLowerTriangularInPlace(rhs_and_solution); in TEST_F()
320 EXPECT_NEAR(rhs_and_solution[i], expected[i], 1e-4) << i; in TEST_F()
325 double rhs_and_solution[] = {1.0, 1.0, 2.0, 2.0}; in TEST_F() local
328 matrix_->SolveLowerTriangularTransposeInPlace(rhs_and_solution); in TEST_F()
330 EXPECT_NEAR(rhs_and_solution[i], expected[i], 1e-4) << i; in TEST_F()
|