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

  /external/ceres-solver/include/ceres/
normal_prior.h 70 Matrix A_;
  /external/ceres-solver/internal/ceres/
block_sparse_matrix_test.cc 51 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
57 CHECK_EQ(A_->num_rows(), B_->num_rows());
58 CHECK_EQ(A_->num_cols(), B_->num_cols());
59 CHECK_EQ(A_->num_nonzeros(), B_->num_nonzeros());
62 scoped_ptr<BlockSparseMatrix> A_;
67 A_->SetZero();
68 EXPECT_EQ(13, A_->num_nonzeros());
72 Vector y_a = Vector::Zero(A_->num_rows());
73 Vector y_b = Vector::Zero(A_->num_rows());
74 for (int i = 0; i < A_->num_cols(); ++i)
    [all...]
cgnr_linear_operator.h 83 : A_(A), D_(D), z_(new double[A.num_rows()]) {
88 std::fill(z_.get(), z_.get() + A_.num_rows(), 0.0);
91 A_.RightMultiply(x, z_.get());
94 A_.LeftMultiply(z_.get(), y);
98 int n = A_.num_cols();
108 virtual int num_rows() const { return A_.num_cols(); }
109 virtual int num_cols() const { return A_.num_cols(); }
112 const LinearOperator& A_;
iterative_schur_complement_solver_test.cc 66 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
70 num_cols_ = A_->num_cols();
71 num_rows_ = A_->num_rows();
76 TripletSparseMatrix triplet_A(A_->num_rows(),
77 A_->num_cols(),
78 A_->num_nonzeros());
79 A_->ToTripletSparseMatrix(&triplet_A);
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data());
114 scoped_ptr<BlockSparseMatrix> A_;
partitioned_matrix_view_test.cc 56 A_.reset(problem->A.release());
58 num_cols_ = A_->num_cols();
59 num_rows_ = A_->num_rows();
65 *down_cast<BlockSparseMatrix*>(A_.get())));
71 scoped_ptr<SparseMatrix> A_;
80 EXPECT_EQ(pmv_->num_cols(), A_->num_cols());
81 EXPECT_EQ(pmv_->num_rows(), A_->num_rows());
97 A_->RightMultiply(x2.data(), y2.data());
117 A_->RightMultiply(x2.data(), y2.data());
134 A_->LeftMultiply(x.data(), y.data())
    [all...]
unsymmetric_linear_solver_test.cc 52 A_.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
65 Vector x_unregularized(A_->num_cols());
66 Vector x_regularized(A_->num_cols());
72 transformed_A.reset(new DenseSparseMatrix(*A_));
74 CompressedRowSparseMatrix* crsm = new CompressedRowSparseMatrix(*A_);
76 for (int i = 0; i < A_->num_rows(); ++i) {
80 for (int i = 0; i < A_->num_cols(); ++i) {
109 for (int i = 0; i < A_->num_cols(); ++i) {
112 << ConstVectorRef(sol_unregularized_.get(), A_->num_cols()).transpose()
118 for (int i = 0; i < A_->num_cols(); ++i)
    [all...]
implicit_schur_complement.h 130 virtual int num_rows() const { return A_->num_cols_f(); }
131 virtual int num_cols() const { return A_->num_cols_f(); }
148 scoped_ptr<PartitionedMatrixViewBase> A_;
implicit_schur_complement_test.cc 62 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
66 num_cols_ = A_->num_cols();
67 num_rows_ = A_->num_rows();
75 const CompressedRowBlockStructure* bs = A_->block_structure();
97 eliminator->Eliminate(A_.get(), b_.get(), D, &blhs, rhs->data());
113 eliminator->BackSubstitute(A_.get(), b_.get(), D,
127 isc.Init(*A_, D, b_.get());
182 scoped_ptr<BlockSparseMatrix> A_;
  /external/openfst/src/include/fst/
heap.h 66 if (size_ < A_.size()) {
67 A_[size_] = val;
70 A_.push_back(val);
85 if (Better(val, A_[Parent(i)])) {
88 A_[i] = val;
96 T top = A_[0];
107 return A_[0];
150 T val = A_[j];
151 A_[j] = A_[k]
    [all...]
  /external/openssl/crypto/md5/asm/
md5-ia64.S 90 #define A_ out24
320 mov A_ = AccumA
338 add AccumA = AccumA, A_
381 mov A_ = AccumA ; \
400 add AccumA = AccumA, A_ ; \

Completed in 336 milliseconds