/external/ceres-solver/internal/ceres/ |
linear_operator.h | 48 virtual void RightMultiply(const double* x, double* y) const = 0;
|
cgnr_linear_operator.h | 87 virtual void RightMultiply(const double* x, double* y) const { 91 A_.RightMultiply(x, z_.get()); 105 RightMultiply(x, y);
|
implicit_schur_complement.h | 86 // RightMultiply (and the LeftMultiply) methods are not thread safe as 116 virtual void RightMultiply(const double* x, double* y) const; 121 RightMultiply(x, y); 158 // Temporary storage vectors used to implement RightMultiply.
|
block_jacobi_preconditioner.h | 67 virtual void RightMultiply(const double* x, double* y) const;
|
sparse_matrix.h | 72 virtual void RightMultiply(const double* x, double* y) const = 0;
|
visibility_based_preconditioner.h | 137 // preconditioner.RightMultiply(x, y); 178 // LeftMultiply and num_cols are just calls to RightMultiply and 180 // RightMultiply can be called. 181 virtual void RightMultiply(const double* x, double* y) const; 183 RightMultiply(x, y); 235 // RightMultiply is a const method for LinearOperators. It is 245 // Temporary vector used by RightMultiply. 260 virtual void RightMultiply(const double* x, double* y) const {}
|
conjugate_gradients_solver.cc | 101 A->RightMultiply(x, tmp.data()); 123 per_solve_options.preconditioner->RightMultiply(r.data(), z.data()); 151 A->RightMultiply(p.data(), q.data()); 178 A->RightMultiply(x, tmp.data());
|
dense_sparse_matrix.h | 66 virtual void RightMultiply(const double* x, double* y) const;
|
implicit_schur_complement.cc | 110 void ImplicitSchurComplement::RightMultiply(const double* x, double* y) const { 121 block_diagonal_EtE_inverse_->RightMultiply(tmp_e_cols_.data(), 169 // Similar to RightMultiply, use the block structure of the matrix A 190 block_diagonal_EtE_inverse_->RightMultiply(tmp_e_cols_.data(), y); 213 block_diagonal_EtE_inverse_->RightMultiply(tmp_e_cols_.data(), y2.data());
|
dense_sparse_matrix_test.cc | 62 a->RightMultiply(x.data(), y_a.data()); 63 b->RightMultiply(x.data(), y_b.data()); 91 TEST_F(DenseSparseMatrixTest, RightMultiply) { 103 tsm->RightMultiply(a.data(), b1.data()); 104 dsm->RightMultiply(a.data(), b2.data());
|
block_jacobi_preconditioner.cc | 119 void BlockJacobiPreconditioner::RightMultiply(const double* x, double* y) const { 131 RightMultiply(x, y);
|
block_sparse_matrix.h | 108 virtual void RightMultiply(const double* x, double* y) const;
|
compressed_row_sparse_matrix.h | 87 virtual void RightMultiply(const double* x, double* y) const;
|
triplet_sparse_matrix.h | 63 virtual void RightMultiply(const double* x, double* y) const;
|
block_sparse_matrix_test.cc | 78 A_->RightMultiply(x.data(), y_a.data()); 79 B_->RightMultiply(x.data(), y_b.data());
|
compressed_row_sparse_matrix_test.cc | 59 a->RightMultiply(x.data(), y_a.data()); 60 b->RightMultiply(x.data(), y_b.data()); 88 TEST_F(CompressedRowSparseMatrixTest, RightMultiply) {
|
partitioned_matrix_view_test.cc | 98 A_->RightMultiply(x2.data(), y2.data()); 123 A_->RightMultiply(x2.data(), y2.data());
|
dogleg_strategy.cc | 184 jacobian->RightMultiply(scaled_gradient.data(), Jg.data()); 681 jacobian->RightMultiply(tmp.data(), Jb.row(0).data()); 683 jacobian->RightMultiply(tmp.data(), Jb.row(1).data());
|
implicit_schur_complement_test.cc | 137 isc.RightMultiply(x.data(), z.data());
|
dense_sparse_matrix.cc | 102 void DenseSparseMatrix::RightMultiply(const double* x, double* y) const {
|
compressed_row_sparse_matrix.cc | 199 void CompressedRowSparseMatrix::RightMultiply(const double* x,
|
triplet_sparse_matrix.cc | 182 void TripletSparseMatrix::RightMultiply(const double* x, double* y) const {
|
visibility_based_preconditioner_test.cc | 294 preconditioner_->RightMultiply(x.data(), y.data());
|
block_sparse_matrix.cc | 113 void BlockSparseMatrix::RightMultiply(const double* x, double* y) const {
|
trust_region_minimizer.cc | 277 jacobian->RightMultiply(trust_region_step.data(), model_residuals.data());
|