| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 86 perm = m_permutation.transpose();
132 operator*(const SparseMatrixBase<SparseDerived>& matrix, const Transpose<PermutationBase<PermDerived> >& tperm)
141 operator*(const Transpose<PermutationBase<PermDerived> >& tperm, const SparseMatrixBase<SparseDerived>& matrix)
|
| SparseUtil.h | 84 template<typename Lhs, typename Rhs, bool Transpose> class SparseDenseOuterProduct;
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixVector.h | 272 // let's simply transpose the product
273 Transpose<Dest> destT(dest);
274 SelfadjointProductMatrix<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
275 Transpose<const Lhs>, 0, true>(m_rhs.transpose(), m_lhs.transpose()).scaleAndAddTo(destT, alpha);
|
| TriangularMatrixVector.h | 131 res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
204 typedef TriangularProduct<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),true,Transpose<const Rhs>,false,Transpose<const Lhs>,true> TriangularProductTranspose;
205 Transpose<Dest> dstT(dst);
207 TriangularProductTranspose(m_rhs.transpose(),m_lhs.transpose()), dstT, alpha);
|
| /external/opencv3/modules/cudaarithm/test/ |
| test_core.cpp | 182 // Transpose
184 PARAM_TEST_CASE(Transpose, cv::cuda::DeviceInfo, cv::Size, MatType, UseRoi)
202 CUDA_TEST_P(Transpose, Accuracy)
211 cv::cuda::transpose(loadMat(src), dst);
221 cv::cuda::transpose(loadMat(src, useRoi), dst);
224 cv::transpose(src, dst_gold);
230 INSTANTIATE_TEST_CASE_P(CUDA_Arithm, Transpose, testing::Combine(
|
| /external/dng_sdk/source/ |
| dng_matrix.h | 289 dng_matrix Transpose (const dng_matrix &A);
|
| dng_rect.h | 408 inline dng_rect Transpose (const dng_rect &a)
417 inline dng_rect_real64 Transpose (const dng_rect_real64 &a)
|
| dng_matrix.cpp | 998 dng_matrix Transpose (const dng_matrix &A)
1046 dng_matrix B = Transpose (A);
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 344 Transpose<MatrixType> matt(mat);
350 Transpose<MatrixType> matt(mat);
356 Transpose<MatrixType> matt(mat);
|
| LDLT.h | 407 Transpose<MatrixType> matt(mat);
414 Transpose<MatrixType> matt(mat);
534 dst = dec().transpositionsP().transpose() * dst;
584 res = transpositionsP().transpose() * res;
|
| /external/webrtc/webrtc/modules/audio_processing/beamformer/ |
| matrix_unittest.cc | 81 actual_result.Transpose(initial_mat);
84 initial_mat.Transpose();
|
| /external/eigen/lapack/ |
| dlarft.f | 229 CALL DGEMV( 'Transpose', J-I, I-1, -TAU( I ),
244 CALL DGEMV( 'No transpose', I-1, J-I, -TAU( I ),
251 CALL DTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
288 CALL DGEMV( 'Transpose', N-K+I-J, K-I, -TAU( I ),
303 CALL DGEMV( 'No transpose', K-I, N-K+I-J,
310 CALL DTRMV( 'Lower', 'No transpose', 'Non-unit', K-I,
|
| slarft.f | 229 CALL SGEMV( 'Transpose', J-I, I-1, -TAU( I ),
244 CALL SGEMV( 'No transpose', I-1, J-I, -TAU( I ),
251 CALL STRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
288 CALL SGEMV( 'Transpose', N-K+I-J, K-I, -TAU( I ),
303 CALL SGEMV( 'No transpose', K-I, N-K+I-J,
310 CALL STRMV( 'Lower', 'No transpose', 'Non-unit', K-I,
|
| dlarf.f | 200 CALL DGEMV( 'Transpose', LASTV, LASTC, ONE, C, LDC, V, INCV,
215 CALL DGEMV( 'No transpose', LASTC, LASTV, ONE, C, LDC,
|
| slarf.f | 200 CALL SGEMV( 'Transpose', LASTV, LASTC, ONE, C, LDC, V, INCV,
215 CALL SGEMV( 'No transpose', LASTC, LASTV, ONE, C, LDC,
|
| /external/eigen/test/eigen2/ |
| eigen2_triangular.cpp | 35 VERIFY(m2up.transpose().isLowerTriangular());
39 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
50 m1.template part<Eigen::UpperTriangular>() = (m2.transpose() * m2).lazy();
51 m3 = m2.transpose() * m2;
52 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1);
56 m1.template part<Eigen::LowerTriangular>() = (m2.transpose() * m2).lazy();
65 Transpose<MatrixType> trm4(m4);
69 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>()
70 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>()))
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_row_sparse_matrix_test.cc | 334 TEST(CompressedRowSparseMatrix, Transpose) {
389 scoped_ptr<CompressedRowSparseMatrix> transpose(matrix.Transpose());
391 ASSERT_EQ(transpose->row_blocks().size(), matrix.col_blocks().size());
392 for (int i = 0; i < transpose->row_blocks().size(); ++i) {
393 EXPECT_EQ(transpose->row_blocks()[i], matrix.col_blocks()[i]);
396 ASSERT_EQ(transpose->col_blocks().size(), matrix.row_blocks().size());
397 for (int i = 0; i < transpose->col_blocks().size(); ++i) {
398 EXPECT_EQ(transpose->col_blocks()[i], matrix.row_blocks()[i]);
405 transpose->ToDenseMatrix(&dense_transpose)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| DenseBase.h | 285 Eigen::Transpose<Derived> transpose();
286 typedef typename internal::add_const<Transpose<const Derived> >::type ConstTransposeReturnType;
287 ConstTransposeReturnType transpose() const;
|
| GeneralProduct.h | 211 Base::coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum();
362 Transpose<Dest> destT(dest);
365 ::run(GeneralProduct<Transpose<const typename ProductType::_RhsNested>,Transpose<const typename ProductType::_LhsNested>, GemvProduct>
366 (prod.rhs().transpose(), prod.lhs().transpose()), destT, alpha);
552 dest.coeffRef(i) += alpha * (prod.lhs().row(i).cwiseProduct(prod.rhs().transpose())).sum();
|
| TriangularMatrix.h | 267 /** \sa MatrixBase::transpose() */
268 inline TriangularView<Transpose<MatrixType>,TransposeMode> transpose() function in class:Eigen::TriangularView
271 return m_matrix.const_cast_derived().transpose();
273 /** \sa MatrixBase::transpose() const */
274 inline const TriangularView<Transpose<MatrixType>,TransposeMode> transpose() const function in class:Eigen::TriangularView
276 return m_matrix.transpose();
|
| /external/opencv3/modules/cudaarithm/perf/ |
| perf_core.cpp | 135 // Transpose
137 PERF_TEST_P(Sz_Type, Transpose,
152 TEST_CYCLE() cv::cuda::transpose(d_src, dst);
160 TEST_CYCLE() cv::transpose(src, dst);
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 84 template<typename MatrixType> class Transpose;
|
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 50 * In addition to the adjoint, you can also apply the inverse (=adjoint), the transpose, and the conjugate operators.
92 typedef Transpose<Block<const VectorsType, 1, Dynamic> > EssentialVectorType;
98 return Block<const VectorsType,1,Dynamic>(h.m_vectors, k, start, 1, h.rows()-start).transpose();
202 /** \brief %Transpose of the Householder sequence. */
203 HouseholderSequence transpose() const function in class:Eigen::HouseholderSequence
217 /** \brief Adjoint (conjugate transpose) of the Householder sequence. */
377 /** \brief Sets the transpose flag.
378 * \param [in] trans New value of the transpose flag.
380 * By default, the transpose flag is not set. If the transpose flag is set, then this object represents
[all...] |
| /external/eigen/test/ |
| triangular.cpp | 39 VERIFY(m2up.transpose().isLowerTriangular());
43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
55 m3 = m2.transpose() + m2;
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1);
60 m1.template triangularView<Lower>() = m2.transpose() + m2;
70 Transpose<MatrixType> trm4(m4);
75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps))
[all...] |
| /external/libavc/common/arm/ |
| ih264_ihadamard_scaling_a9.s | 123 vtrn.32 q2, q3 @Transpose the register for vertical transform
|
