OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:A_
(Results
1 - 12
of
12
) sorted by null
/external/ceres-solver/include/ceres/
normal_prior.h
69
Matrix
A_
;
/external/ceres-solver/internal/ceres/
block_sparse_matrix_test.cc
52
A_
.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
58
CHECK_EQ(
A_
->num_rows(), B_->num_rows());
59
CHECK_EQ(
A_
->num_cols(), B_->num_cols());
60
CHECK_EQ(
A_
->num_nonzeros(), B_->num_nonzeros());
63
scoped_ptr<BlockSparseMatrix>
A_
;
68
A_
->SetZero();
69
EXPECT_EQ(13,
A_
->num_nonzeros());
73
Vector y_a = Vector::Zero(
A_
->num_rows());
74
Vector y_b = Vector::Zero(
A_
->num_rows());
75
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);
98
isc.Solve(
A_
.get(), b_.get(), per_solve_options, isc_sol.data());
112
scoped_ptr<BlockSparseMatrix>
A_
;
partitioned_matrix_view_test.cc
55
A_
.reset(problem->A.release());
57
num_cols_ =
A_
->num_cols();
58
num_rows_ =
A_
->num_rows();
66
scoped_ptr<SparseMatrix>
A_
;
70
PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(
A_
.get()),
76
EXPECT_EQ(m.num_cols(),
A_
->num_cols());
77
EXPECT_EQ(m.num_rows(),
A_
->num_rows());
81
PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(
A_
.get()),
98
A_
->RightMultiply(x2.data(), y2.data());
106
PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(
A_
.get())
[
all
...]
unsymmetric_linear_solver_test.cc
52
A_
.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
71
Vector x_unregularized(
A_
->num_cols());
72
Vector x_regularized(
A_
->num_cols());
78
transformed_A.reset(new DenseSparseMatrix(*
A_
));
80
transformed_A.reset(new CompressedRowSparseMatrix(*
A_
));
101
for (int i = 0; i <
A_
->num_cols(); ++i) {
106
for (int i = 0; i <
A_
->num_cols(); ++i) {
111
scoped_ptr<TripletSparseMatrix>
A_
;
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(); }
149
scoped_ptr<PartitionedMatrixView>
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,
124
isc.Init(*
A_
, D, b_.get());
179
scoped_ptr<BlockSparseMatrix>
A_
;
visibility_based_preconditioner_test.cc
71
A_
.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
76
CHECK_NOTNULL(
A_
->block_structure());
79
num_cols_ =
A_
->num_cols();
80
num_rows_ =
A_
->num_rows();
85
A_
->block_structure()->cols.size() - num_eliminate_blocks_);
104
eliminator->Eliminate(
A_
.get(), b_.get(), D_.get(),
110
preconditioner_->InitStorage(*
A_
->block_structure());
134
preconditioner_->Update(*
A_
, D_.get());
228
scoped_ptr<BlockSparseMatrix>
A_
;
241
new VisibilityBasedPreconditioner(*
A_
->block_structure(), options_))
[
all
...]
/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/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h
60
if (size_ < (int)
A_
.size()) {
61
A_
[size_] = val;
64
A_
.push_back(val);
79
if (comp_(val,
A_
[Parent(i)])) {
82
A_
[i] = val;
89
T max =
A_
[0];
99
return
A_
[0];
142
T val =
A_
[j];
143
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 3605 milliseconds