Home
last modified time | relevance | path

Searched refs:num_cols (Results 1 – 25 of 81) sorted by relevance

1234

/external/ceres-solver/internal/ceres/
Dnormal_prior_test.cc59 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
60 Vector b(num_cols); in TEST()
63 Matrix A(num_rows, num_cols); in TEST()
66 double * x = new double[num_cols]; in TEST()
67 for (int i = 0; i < num_cols; ++i) in TEST()
70 double * jacobian = new double[num_rows * num_cols]; in TEST()
78 (residuals - A * (VectorRef(x, num_cols) - b)).squaredNorm(); in TEST()
82 MatrixRef J(jacobian, num_rows, num_cols); in TEST()
96 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
97 Vector b(num_cols); in TEST()
[all …]
Ddense_sparse_matrix_test.cc50 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
53 int num_cols = a->num_cols(); in CompareMatrices() local
55 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
56 Vector x = Vector::Zero(num_cols); in CompareMatrices()
81 num_cols = tsm->num_cols(); in SetUp()
85 int num_cols; member in ceres::internal::DenseSparseMatrixTest
96 Vector a(num_cols); in TEST_F()
97 for (int i = 0; i < num_cols; i++) { in TEST_F()
114 Vector b1 = Vector::Zero(num_cols); in TEST_F()
115 Vector b2 = Vector::Zero(num_cols); in TEST_F()
[all …]
Ddense_normal_cholesky_solver.cc72 const int num_cols = A->num_cols(); in SolveUsingEigen() local
75 Matrix lhs(num_cols, num_cols); in SolveUsingEigen()
91 ConstVectorRef D(per_solve_options.D, num_cols); in SolveUsingEigen()
99 VectorRef(x, num_cols) = in SolveUsingEigen()
118 const int num_cols = A->num_cols(); in SolveUsingLAPACK() local
119 Matrix lhs(num_cols, num_cols); in SolveUsingLAPACK()
127 num_cols, in SolveUsingLAPACK()
141 VectorRef(x, num_cols) = in SolveUsingLAPACK()
145 const int info = LAPACK::SolveInPlaceUsingCholesky(num_cols, lhs.data(), x); in SolveUsingLAPACK()
Dblock_random_access_crs_matrix.cc60 int num_cols = 0; in BlockRandomAccessCRSMatrix() local
62 col_layout_[i] = num_cols; in BlockRandomAccessCRSMatrix()
63 num_cols += blocks_[i]; in BlockRandomAccessCRSMatrix()
76 VLOG(2) << "Matrix Size [" << num_cols in BlockRandomAccessCRSMatrix()
77 << "," << num_cols in BlockRandomAccessCRSMatrix()
80 crsm_.reset(new CompressedRowSparseMatrix(num_cols, num_cols, num_nonzeros)); in BlockRandomAccessCRSMatrix()
98 int num_cols = 0; in BlockRandomAccessCRSMatrix() local
101 new CellInfo(values + num_cols); in BlockRandomAccessCRSMatrix()
103 num_cols += blocks_[it->second]; in BlockRandomAccessCRSMatrix()
109 rows[row_pos + j + 1] = rows[row_pos + j] + num_cols; in BlockRandomAccessCRSMatrix()
[all …]
Dsparse_normal_cholesky_solver.cc105 const int num_cols = A->num_cols(); in SolveImplUsingCXSparse() local
106 Vector Atb = Vector::Zero(num_cols); in SolveImplUsingCXSparse()
112 CompressedRowSparseMatrix D(per_solve_options.D, num_cols); in SolveImplUsingCXSparse()
116 VectorRef(x, num_cols).setZero(); in SolveImplUsingCXSparse()
133 A->DeleteRows(num_cols); in SolveImplUsingCXSparse()
183 const int num_cols = A->num_cols(); in SolveImplUsingSuiteSparse() local
185 Vector Atb = Vector::Zero(num_cols); in SolveImplUsingSuiteSparse()
191 CompressedRowSparseMatrix D(per_solve_options.D, num_cols); in SolveImplUsingSuiteSparse()
195 VectorRef(x, num_cols).setZero(); in SolveImplUsingSuiteSparse()
198 cholmod_dense* rhs = ss_.CreateDenseVector(Atb.data(), num_cols, num_cols); in SolveImplUsingSuiteSparse()
[all …]
Ddense_sparse_matrix.cc42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols) in DenseSparseMatrix() argument
45 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
50 int num_cols, in DenseSparseMatrix() argument
56 m_.resize(num_rows + num_cols, num_cols); in DenseSparseMatrix()
58 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
64 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())), in DenseSparseMatrix()
88 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols()); in RightMultiply()
92 VectorRef(y, num_cols()) += in LeftMultiply()
97 VectorRef(x, num_cols()) = m_.colwise().squaredNorm(); in SquaredColumnNorm()
101 m_ *= ConstVectorRef(scale, num_cols()).asDiagonal(); in ScaleColumns()
[all …]
Dcompressed_row_sparse_matrix_test.cc47 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
50 int num_cols = a->num_cols(); in CompareMatrices() local
52 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
53 Vector x = Vector::Zero(num_cols); in CompareMatrices()
78 num_cols = tsm->num_cols(); in SetUp()
82 int num_cols; member in ceres::internal::CompressedRowSparseMatrixTest
97 Vector b1 = Vector::Zero(num_cols); in TEST_F()
98 Vector b2 = Vector::Zero(num_cols); in TEST_F()
108 Vector b1 = Vector::Zero(num_cols); in TEST_F()
109 Vector b2 = Vector::Zero(num_cols); in TEST_F()
[all …]
Dcompressed_col_sparse_matrix_utils.h70 void SolveUpperTriangularInPlace(IntegerType num_cols, in SolveUpperTriangularInPlace() argument
75 for (IntegerType c = num_cols - 1; c >= 0; --c) { in SolveUpperTriangularInPlace()
91 void SolveUpperTriangularTransposeInPlace(IntegerType num_cols, in SolveUpperTriangularTransposeInPlace() argument
96 for (IntegerType c = 0; c < num_cols; ++c) { in SolveUpperTriangularTransposeInPlace()
117 void SolveRTRWithSparseRHS(IntegerType num_cols, in SolveRTRWithSparseRHS() argument
123 fill(solution, solution + num_cols, 0.0); in SolveRTRWithSparseRHS()
126 for (IntegerType c = rhs_nonzero_index + 1; c < num_cols; ++c) { in SolveRTRWithSparseRHS()
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution); in SolveRTRWithSparseRHS()
Dlinear_least_squares_problems.cc182 int num_cols = 5; in LinearLeastSquaresProblem1() local
186 num_cols, in LinearLeastSquaresProblem1()
187 num_rows * num_cols); in LinearLeastSquaresProblem1()
189 problem->D.reset(new double[num_cols]); in LinearLeastSquaresProblem1()
273 for (int i = 0; i < num_cols; ++i) { in LinearLeastSquaresProblem1()
287 int num_cols = 5; in LinearLeastSquaresProblem2() local
292 problem->D.reset(new double[num_cols]); in LinearLeastSquaresProblem2()
296 scoped_array<double> values(new double[num_rows * num_cols]); in LinearLeastSquaresProblem2()
298 for (int c = 0; c < num_cols; ++c) { in LinearLeastSquaresProblem2()
389 for (int i = 0; i < num_cols; ++i) { in LinearLeastSquaresProblem2()
[all …]
Dblock_sparse_matrix_test.cc58 CHECK_EQ(A_->num_cols(), B_->num_cols()); in SetUp()
74 for (int i = 0; i < A_->num_cols(); ++i) { in TEST_F()
75 Vector x = Vector::Zero(A_->num_cols()); in TEST_F()
84 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
85 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
96 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
97 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
Dconjugate_gradients_solver.cc76 CHECK_EQ(A->num_rows(), A->num_cols()); in Solve()
82 int num_cols = A->num_cols(); in Solve() local
83 VectorRef xref(x, num_cols); in Solve()
84 ConstVectorRef bref(b, num_cols); in Solve()
93 Vector r(num_cols); in Solve()
94 Vector p(num_cols); in Solve()
95 Vector z(num_cols); in Solve()
96 Vector tmp(num_cols); in Solve()
Ddense_qr_solver.cc71 const int num_cols = A->num_cols(); in SolveUsingLAPACK() local
114 VectorRef(x, num_cols) = rhs_.head(num_cols); in SolveUsingLAPACK()
132 const int num_cols = A->num_cols(); in SolveUsingEigen() local
142 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); in SolveUsingEigen()
151 VectorRef(x, num_cols) = A->matrix().householderQr().solve(rhs_); in SolveUsingEigen()
Dschur_eliminator_test.cc139 const int num_cols = A->num_cols(); in EliminateSolveAndCompare() local
159 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols()); in EliminateSolveAndCompare()
167 Vector sol(num_cols); in EliminateSolveAndCompare()
198 Vector zero(A->num_cols()); in TEST_F()
201 ComputeReferenceSolution(VectorRef(zero.data(), A->num_cols())); in TEST_F()
202 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), true, 1e-14); in TEST_F()
203 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), false, 1e-14); in TEST_F()
205 ComputeReferenceSolution(VectorRef(D.get(), A->num_cols())); in TEST_F()
206 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), true, 1e-14); in TEST_F()
207 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), false, 1e-14); in TEST_F()
Dschur_complement_solver_test.cc58 num_cols = A->num_cols(); in SetUpFromProblemId()
62 x.reset(new double[num_cols]); in SetUpFromProblemId()
63 sol.reset(new double[num_cols]); in SetUpFromProblemId()
64 sol_d.reset(new double[num_cols]); in SetUpFromProblemId()
72 A->num_cols(), in SetUpFromProblemId()
116 for (int i = 0; i < num_cols; ++i) { in ComputeAndCompareSolutions()
120 for (int i = 0; i < num_cols; ++i) { in ComputeAndCompareSolutions()
127 int num_cols; member in ceres::internal::SchurComplementSolverTest
Dcorrector.cc113 int num_cols, in CorrectJacobian() argument
130 for (int c = 0; c < num_cols; ++c) { in CorrectJacobian()
133 r_transpose_j += jacobian[r * num_cols + c] * residuals[r]; in CorrectJacobian()
137 jacobian[r * num_cols + c] = sqrt_rho1_ * in CorrectJacobian()
138 (jacobian[r * num_cols + c] - in CorrectJacobian()
Dblock_random_access_sparse_matrix.cc56 int num_cols = 0; in BlockRandomAccessSparseMatrix() local
59 col_layout.push_back(num_cols); in BlockRandomAccessSparseMatrix()
60 num_cols += blocks_[i]; in BlockRandomAccessSparseMatrix()
75 VLOG(1) << "Matrix Size [" << num_cols in BlockRandomAccessSparseMatrix()
76 << "," << num_cols in BlockRandomAccessSparseMatrix()
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros)); in BlockRandomAccessSparseMatrix()
Dpartitioned_matrix_view_test.cc57 num_cols_ = A_->num_cols(); in SetUp()
76 EXPECT_EQ(m.num_cols(), A_->num_cols()); in TEST_F()
87 Vector x2(m.num_cols()); in TEST_F()
112 Vector x2 = Vector::Zero(m.num_cols()); in TEST_F()
141 Vector y = Vector::Zero(m.num_cols()); in TEST_F()
149 for (int i = 0; i < m.num_cols(); ++i) { in TEST_F()
165 EXPECT_EQ(block_diagonal_ee->num_cols(), 2); in TEST_F()
182 EXPECT_EQ(block_diagonal_ff->num_cols(), 3); in TEST_F()
Dcgnr_linear_operator.h98 int n = A_.num_cols(); in RightMultiply()
108 virtual int num_rows() const { return A_.num_cols(); } in num_rows()
109 virtual int num_cols() const { return A_.num_cols(); } in num_cols() function
Dimplicit_schur_complement.cc130 ConstVectorRef Dref(D_ + A_->num_cols_e(), num_cols()); in RightMultiply()
131 VectorRef(y, num_cols()) = in RightMultiply()
133 ConstVectorRef(x, num_cols()).array()).matrix(); in RightMultiply()
135 VectorRef(y, num_cols()).setZero(); in RightMultiply()
174 const int num_cols = A_->num_cols(); in BackSubstitute() local
189 VectorRef(y, num_cols).setZero(); in BackSubstitute()
Dincomplete_lq_factorization_test.cc46 EXPECT_EQ(expected.num_cols(), actual.num_cols()); in ExpectMatricesAreEqual()
138 EXPECT_EQ(matrix.num_cols(), 10); in TEST()
146 EXPECT_EQ(matrix.num_cols(), 10); in TEST()
156 EXPECT_EQ(matrix.num_cols(), 10); in TEST()
170 EXPECT_EQ(matrix.num_cols(), 10); in TEST()
186 EXPECT_EQ(matrix.num_cols(), 10); in TEST()
Dlapack.cc94 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) { in EstimateWorkSizeForQR() argument
106 &num_cols, in EstimateWorkSizeForQR()
122 int num_cols, in SolveUsingQR() argument
133 int n = num_cols; in SolveUsingQR()
/external/jpeg/
Djdcolor.c150 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_convert() local
165 for (col = 0; col < num_cols; col++) { in ycc_rgb_convert()
191 JDIMENSION num_cols = cinfo->output_width; in ycc_rgba_8888_convert() local
206 for (col = 0; col < num_cols; col++) { in ycc_rgba_8888_convert()
232 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565_convert() local
260 num_cols--; in ycc_rgb_565_convert()
262 for (col = 0; col < (num_cols>>1); col++) { in ycc_rgb_565_convert()
281 if (num_cols&1) { in ycc_rgb_565_convert()
304 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565D_convert() local
332 num_cols--; in ycc_rgb_565D_convert()
[all …]
/external/qemu/distrib/jpeg-6b/
Djdcolor.c148 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_convert() local
163 for (col = 0; col < num_cols; col++) { in ycc_rgb_convert()
189 JDIMENSION num_cols = cinfo->output_width; in ycc_rgba_8888_convert() local
204 for (col = 0; col < num_cols; col++) { in ycc_rgba_8888_convert()
230 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565_convert() local
258 num_cols--; in ycc_rgb_565_convert()
260 for (col = 0; col < (num_cols>>1); col++) { in ycc_rgb_565_convert()
279 if (num_cols&1) { in ycc_rgb_565_convert()
302 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565D_convert() local
330 num_cols--; in ycc_rgb_565D_convert()
[all …]
Djccolor.c142 JDIMENSION num_cols = cinfo->image_width; in rgb_ycc_convert() local
150 for (col = 0; col < num_cols; col++) { in rgb_ycc_convert()
189 JDIMENSION num_cols = cinfo->image_width; in rgb565_ycc_convert() local
197 for (col = 0; col < num_cols; col++) { in rgb565_ycc_convert()
235 JDIMENSION num_cols = cinfo->image_width; in rgba8888_ycc_convert() local
243 for (col = 0; col < num_cols; col++) { in rgba8888_ycc_convert()
291 JDIMENSION num_cols = cinfo->image_width; in rgb_gray_convert() local
297 for (col = 0; col < num_cols; col++) { in rgb_gray_convert()
330 JDIMENSION num_cols = cinfo->image_width; in cmyk_ycck_convert() local
339 for (col = 0; col < num_cols; col++) { in cmyk_ycck_convert()
[all …]
/external/ceres-solver/include/ceres/internal/
Deigen.h65 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
67 typedef Eigen::Matrix <double, num_rows, num_cols, Eigen::RowMajor>
71 Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
83 const Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >

1234