HomeSort by relevance Sort by last modified time
    Searched defs:RightMultiply (Results 1 - 12 of 12) sorted by null

  /external/ceres-solver/internal/ceres/
low_rank_inverse_hessian.cc 89 void LowRankInverseHessian::RightMultiply(const double* x_ptr,
preconditioner.cc 53 void SparseMatrixPreconditionerWrapper::RightMultiply(const double* x,
55 matrix_->RightMultiply(x, y);
cgnr_linear_operator.h 87 virtual void RightMultiply(const double* x, double* y) const {
91 A_.RightMultiply(x, z_.get());
105 RightMultiply(x, y);
block_jacobi_preconditioner.cc 120 void BlockJacobiPreconditioner::RightMultiply(const double* x,
133 RightMultiply(x, y);
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());
schur_jacobi_preconditioner.cc 115 void SchurJacobiPreconditioner::RightMultiply(const double* x,
block_sparse_matrix.cc 88 void BlockSparseMatrix::RightMultiply(const double* x, double* y) const {
dense_sparse_matrix.cc 87 void DenseSparseMatrix::RightMultiply(const double* x, double* y) const {
visibility_based_preconditioner.h 123 // preconditioner.RightMultiply(x, y);
139 virtual void RightMultiply(const double* x, double* y) const;
190 // RightMultiply is a const method for LinearOperators. It is
200 // Temporary vector used by RightMultiply.
215 virtual void RightMultiply(const double* x, double* y) const {}
compressed_row_sparse_matrix.cc 160 void CompressedRowSparseMatrix::RightMultiply(const double* x,
triplet_sparse_matrix.cc 155 void TripletSparseMatrix::RightMultiply(const double* x, double* y) const {
visibility_based_preconditioner.cc 108 // RightMultiply.
432 void VisibilityBasedPreconditioner::RightMultiply(const double* x,

Completed in 3197 milliseconds