OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:rhs_and_solution
(Results
1 - 7
of
7
) sorted by null
/external/ceres-solver/internal/ceres/
lapack.h
60
double*
rhs_and_solution
,
79
// When calling,
rhs_and_solution
contains the rhs, and upon return
93
double*
rhs_and_solution
,
compressed_col_sparse_matrix_utils.h
74
double*
rhs_and_solution
) {
76
rhs_and_solution
[c] /= values[cols[c + 1] - 1];
80
rhs_and_solution
[r] -= v *
rhs_and_solution
[c];
95
double*
rhs_and_solution
) {
100
rhs_and_solution
[c] -= v *
rhs_and_solution
[r];
102
rhs_and_solution
[c] =
rhs_and_solution
[c] / values[cols[c + 1] - 1];
sparse_normal_cholesky_solver.h
71
double*
rhs_and_solution
);
77
double*
rhs_and_solution
);
83
double*
rhs_and_solution
);
lapack.cc
72
double*
rhs_and_solution
,
101
dpotrs_(&uplo, &n, &nrhs, lhs, &n,
rhs_and_solution
, &n, &info);
153
double*
rhs_and_solution
,
174
rhs_and_solution
,
sparse_normal_cholesky_solver.cc
128
double *
rhs_and_solution
) {
181
const Vector b = VectorRef(
rhs_and_solution
, outer_product_->num_rows());
206
VectorRef(
rhs_and_solution
, outer_product_->num_rows()) =
225
double *
rhs_and_solution
) {
294
} else if (!cxsparse_.SolveCholesky(AtA, cxsparse_factor_,
rhs_and_solution
)) {
307
double *
rhs_and_solution
) {
362
cholmod_dense* rhs = ss_.CreateDenseVector(
rhs_and_solution
, num_cols, num_cols);
368
memcpy(
rhs_and_solution
, solution->x, num_cols * sizeof(*
rhs_and_solution
));
compressed_col_sparse_matrix_utils_test.cc
234
double
rhs_and_solution
[] = {1.0, 1.0, 2.0, 2.0};
local
241
rhs_and_solution
);
244
EXPECT_NEAR(
rhs_and_solution
[i], expected[i], 1e-4) << i;
249
double
rhs_and_solution
[] = {1.0, 1.0, 2.0, 2.0};
local
256
rhs_and_solution
);
259
EXPECT_NEAR(
rhs_and_solution
[i], expected[i], 1e-4) << i;
compressed_row_sparse_matrix_test.cc
316
double
rhs_and_solution
[] = {1.0, 1.0, 2.0, 2.0};
local
318
matrix_->SolveLowerTriangularInPlace(
rhs_and_solution
);
320
EXPECT_NEAR(
rhs_and_solution
[i], expected[i], 1e-4) << i;
325
double
rhs_and_solution
[] = {1.0, 1.0, 2.0, 2.0};
local
328
matrix_->SolveLowerTriangularTransposeInPlace(
rhs_and_solution
);
330
EXPECT_NEAR(
rhs_and_solution
[i], expected[i], 1e-4) << i;
Completed in 183 milliseconds