| /external/eigen/bench/ |
| sparse_product.cpp | 133 m3 = m1.transpose() * m2;
140 m3 = m1.transpose() * m2.transpose();
147 m3 = m1 * m2.transpose();
161 // BENCH(sm3 = sm1.transpose() * sm2; )
164 // BENCH(sm3 = sm1.transpose() * sm2.transpose(); )
167 // BENCH(sm3 = sm1 * sm2.transpose(); )
176 // BENCH(sm3._experimentalNewProduct(sm1.transpose(),sm2); )
179 // BENCH(sm3._experimentalNewProduct(sm1.transpose(),sm2.transpose());
[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...] |
| product_trmv.cpp | 50 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));
52 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));
54 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() * v1, largerEps));
56 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() * v1, largerEps));
67 VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(), largerEps))
[all...] |
| sparse_solvers.cpp | 70 // lower - transpose
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2),
73 m2.transpose().template triangularView<Upper>().solve(vec3));
75 // upper - transpose
77 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Lower>().solve(vec2),
78 m2.transpose().template triangularView<Lower>().solve(vec3));
|
| commainitializer.cpp | 42 m3 << vec[0].transpose(),
44 vec[2].transpose();
|
| product_extra.cpp | 64 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2),
65 (s1 * vc2.transpose()).eval() * (-m1.adjoint()*s2).eval());
66 VERIFY_IS_APPROX((s1 * vc2.adjoint()) * (-m1.transpose() * s2),
67 (s1 * vc2.adjoint()).eval() * (-m1.transpose()*s2).eval());
71 VERIFY_IS_APPROX((-m1.adjoint() * s2) * (s1 * v1.transpose()),
72 (-m1.adjoint()*s2).eval() * (s1 * v1.transpose()).eval());
73 VERIFY_IS_APPROX((-m1.transpose() * s2) * (s1 * v1.adjoint()),
74 (-m1.transpose()*s2).eval() * (s1 * v1.adjoint()).eval());
111 VERIFY_IS_APPROX(dNdxy.transpose()*dNdxy*det*wt, det*wt*dNdxy.transpose()*dNdxy)
[all...] |
| product_notemporary.cpp | 63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0);
85 VERIFY_EVALUATION_COUNT( m1.adjoint().template triangularView<Lower>().solveInPlace(m3.transpose()), 0);
107 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose().lazyProduct(m3)).diagonal().sum(), 0 );
110 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose() * m3).diagonal().sum(), 0 );
111 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose() * m3).diagonal().array().abs().sum(), 0 );
115 //VERIFY_EVALUATION_COUNT( m3.col(0).head<5>() * m3.col(0).transpose() + m3.col(0).head<5>() * m3.col(0).transpose(), 0 );
122 VERIFY_EVALUATION_COUNT( cvres.noalias() -= m1 * m2.row(0).transpose(), 0 );
|
| block.cpp | 41 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1));
111 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() );
112 VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() );
118 VERIFY_IS_EQUAL( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , ((m1+m2).row(r1).segment(c1,c2-c1+1)).transpose() );
119 VERIFY_IS_EQUAL( ((m1+m2).transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , ((m1+m2).row(r1).segment(c1,c2-c1+1)).transpose() );
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| Parallelizer.h | 86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose)
91 // FIXME the transpose variable is only needed to properly split
95 EIGEN_UNUSED_VARIABLE(transpose);
110 Index size = transpose ? cols : rows;
125 if(transpose)
145 if(transpose)
|
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 15 Transpose.h Conjugate.h Dot.h
43 // check basic compatibility of adjoint, transpose, conjugate
44 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1);
45 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1);
79 // check inplace transpose
82 VERIFY_IS_APPROX(m3,m1.transpose());
|
| eigen2_commainitializer.cpp | 42 m3 << vec[0].transpose(),
44 vec[2].transpose();
|
| /external/ceres-solver/internal/ceres/ |
| blas.h | 41 // transpose = true : c = alpha * a'a + beta * c;
42 // transpose = false : c = alpha * aa' + beta * c;
48 bool transpose,
|
| blas.cc | 51 bool transpose,
59 char trans = transpose ? 'T' : 'N';
60 int n = transpose ? num_cols : num_rows;
61 int k = transpose ? num_rows : num_cols;
|
| corrector_test.cc | 192 res * res.transpose() * jac);
194 g_grad = rho[1] * jac.transpose() * res;
195 g_hess = rho[1] * jac.transpose() * jac +
196 2.0 * rho[2] * jac.transpose() * res * res.transpose() * jac;
203 c_grad = jac.transpose() * res;
204 c_hess = jac.transpose() * jac;
255 g_grad = rho[1] * jac.transpose() * res;
256 g_hess = rho[1] * jac.transpose() * jac +
257 2.0 * rho[2] * jac.transpose() * res * res.transpose() * jac
[all...] |
| implicit_schur_complement_test.cc | 106 lhs_ref.triangularView<Eigen::StrictlyUpper>().transpose();
144 << "column " << i << ". explicit: " << y.transpose()
145 << " implicit: " << z.transpose();
153 << "rhs. explicit: " << rhs.transpose()
154 << " implicit: " << isc.rhs().transpose();
168 << "explicit: " << reference_solution.transpose()
169 << " implicit: " << sol.transpose();
|
| /cts/tests/tests/media/src/android/media/cts/ |
| JetPlayerTest.java | 94 int transpose = 0; local
96 assertTrue(mJetPlayer.queueJetSegmentMuteArray(segmentNum, libNum, repeatCount, transpose,
105 assertTrue(mJetPlayer.queueJetSegmentMuteArray(segmentNum, libNum, repeatCount, transpose,
119 int transpose = 0; local
121 mJetPlayer.queueJetSegment(segmentNum, libNum, repeatCount, transpose, muteFlags, userID);
125 transpose = -1;
126 mJetPlayer.queueJetSegment(segmentNum, libNum, repeatCount, transpose, muteFlags, userID);
129 transpose = 0;
130 mJetPlayer.queueJetSegment(segmentNum, libNum, repeatCount, transpose, muteFlags, userID);
|
| /external/sonivox/jet_tools/JetCreator/ |
| JetDebug.py | 40 print("transpose: %d" % queueSeg.transpose)
53 print("transpose: %d" % segment.transpose)
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 30 /* copy r and (q transpose)*b to preserve input and initialize s. */
35 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
49 /* modify only a single element of (q transpose)*b */
58 /* the modified element of ((q transpose)*b,0). */
79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
|
| /external/eigen/doc/ |
| C02_TutorialMatrixArithmetic.dox | 94 The transpose \f$ a^T \f$, conjugate \f$ \bar{a} \f$, and adjoint (i.e., conjugate transpose) \f$ a^* \f$ of a matrix or vector \f$ a \f$ are obtained by the member functions \link DenseBase::transpose() transpose()\endlink, \link MatrixBase::conjugate() conjugate()\endlink, and \link MatrixBase::adjoint() adjoint()\endlink, respectively.
105 For real matrices, \c conjugate() is a no-operation, and so \c adjoint() is equivalent to \c transpose().
107 As for basic arithmetic operators, \c transpose() and \c adjoint() simply return a proxy object without doing the actual transposition. If you do <tt>b = a.transpose()</tt>, then the transpose is evaluated at the same time as the result is written into \c b. However, there is a complication here. If you do <tt>a = a.transpose()</tt>, then Eigen starts writing the result into \c a before the evaluation of the transpose is finished. Therefore, the instruction <tt>a = a.transpose()</tt> does not replace \c a with its (…)
[all...] |
| tutorial.cpp | 58 m4 = m4 * m4.transpose(); // same here, lazy evaluation of the transpose.
59 m4 = m4 * m4.transpose().eval(); // forces immediate evaluation of the transpose
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/vl/ |
| vl_idct.h | 55 struct pipe_sampler_view *transpose; member in struct:vl_idct
73 struct pipe_sampler_view *intermediate, *transpose; member in struct:vl_idct_buffer::__anon12628::__anon12629
96 struct pipe_sampler_view *transpose);
|
| /external/mesa3d/src/gallium/auxiliary/vl/ |
| vl_idct.h | 55 struct pipe_sampler_view *transpose; member in struct:vl_idct
73 struct pipe_sampler_view *intermediate, *transpose; member in struct:vl_idct_buffer::__anon23095::__anon23096
96 struct pipe_sampler_view *transpose);
|
| /external/eigen/doc/snippets/ |
| SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | 2 MatrixXd A = X + X.transpose();
|
| /external/eigen/lapack/ |
| lu.cpp | 75 lu.triangularView<Upper>().transpose().solveInPlace(B);
76 lu.triangularView<UnitLower>().transpose().solveInPlace(B);
77 B = PivotsType(ipiv,*n).transpose() * B;
83 B = PivotsType(ipiv,*n).transpose() * B;
|
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| chroot_file_system.py | 20 |file_system| The FileSystem instance to transpose paths of.
21 |root| The path to transpose all Read/Stat calls by.
|
