| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseSolverBase.h | 38 tmp.leftCols(actualCols) = rhs.middleCols(k,actualCols); in solve_sparse_through_dense_panels()
39 tmpX.leftCols(actualCols) = dec.solve(tmp.leftCols(actualCols)); in solve_sparse_through_dense_panels()
40 dest.middleCols(k,actualCols) = tmpX.leftCols(actualCols).sparseView(); in solve_sparse_through_dense_panels()
|
| /external/eigen/test/ |
| D | svd_common.h | 76 …VERIFY_IS_APPROX( svd.matrixV().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matri… in svd_compare_to_full()
77 …referenceSvd.matrixV().leftCols(diagSize) * referenceSvd.singularValues().asDiagonal() * reference… in svd_compare_to_full()
83 …ERIFY_IS_APPROX( svd.matrixU().leftCols(diagSize) * svd.singularValues().cwiseAbs2().asDiagonal() … in svd_compare_to_full()
84 …eferenceSvd.matrixU().leftCols(diagSize) * referenceSvd.singularValues().cwiseAbs2().asDiagonal() … in svd_compare_to_full()
92 …ptions & ComputeThinU) VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); in svd_compare_to_full()
94 …ptions & ComputeThinV) VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV().leftCols(diagSize)); in svd_compare_to_full()
267 …VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.mat… in svd_test_all_computation_options()
|
| D | corners.cpp | 41 COMPARE_CORNER(leftCols(c), block(0,0,rows,c)); in corners()
78 VERIFY_IS_EQUAL((matrix.template leftCols<c>()), (matrix.template block<rows,c>(0,0))); in corners_fixedsize()
100 …VERIFY_IS_EQUAL((const_matrix.template leftCols<c>()), (const_matrix.template block<rows,c>(0,0))); in corners_fixedsize()
|
| D | sparse_product.cpp | 89 VERIFY_IS_APPROX(m4 = m2*m3.leftCols(cols/2), refMat4 = refMat2*refMat3.leftCols(cols/2)); in sparse_product()
90 …VERIFY_IS_APPROX(m4 = m2*(m3+m3).leftCols(cols/2), refMat4 = refMat2*(refMat3+refMat3).leftCols(co… in sparse_product()
|
| D | product_small.cpp | 207 …C.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()) * A.template topLeftCorn… in test_linear_but_not_vectorizable()
208 …R.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()).eval() * A.template topLeftCorn… in test_linear_but_not_vectorizable()
|
| D | product.h | 206 VERIFY_IS_APPROX(m1.leftCols(1) * m1.row(r), m1.block(0,0,rows,1) * m1.block(r,0,1,cols)); in product()
|
| D | block.cpp | 137 VERIFY_IS_EQUAL(m1.leftCols(c1).coeff(r1+c1*rows), m1(r1,c1)); in block()
|
| /external/eigen/doc/snippets/ |
| D | MatrixBase_template_int_leftCols.cpp | 4 cout << a.leftCols<2>() << endl;
5 a.leftCols<2>().setZero();
|
| D | MatrixBase_leftCols_int.cpp | 4 cout << a.leftCols(2) << endl;
5 a.leftCols(2).setZero();
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | DGMRES.h | 363 tv1 = m_V.leftCols(it) * nrs;
368 x = x + precond.solve(m_V.leftCols(it) * nrs);
461 X = m_V.leftCols(it) * Sr;
486 m_T.block(0, m_r, m_r, nbrEig) = m_U.leftCols(m_r).transpose() * MX;
487 m_T.block(m_r, 0, nbrEig, m_r) = X.transpose() * m_MU.leftCols(m_r);
507 DenseVector x1 = m_U.leftCols(m_r).transpose() * x;
508 y = x + m_U.leftCols(m_r) * ( m_lambdaN * m_luT.solve(x1) - x1);
|
| /external/eigen/doc/examples/ |
| D | Tutorial_BlockOperations_corner.cpp | 13 cout << "m.leftCols(2) =" << endl << m.leftCols(2) << endl << endl; in main()
|
| /external/eigen/Eigen/src/Core/ |
| D | Reverse.h | 144 leftCols(half).swap(rightCols(half).reverse());
186 xpr.leftCols(half).swap(xpr.rightCols(half).rowwise().reverse());
|
| /external/eigen/Eigen/src/SVD/ |
| D | SVDBase.h | 268 tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs; in _solve_impl()
270 dst = m_matrixV.leftCols(l_rank) * tmp; in _solve_impl()
|
| D | BDCSVD.h | 369 A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
370 A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
680 U.leftCols(actual_n).rowwise().reverseInPlace();
681 if (m_compV) V.leftCols(actual_n).rowwise().reverseInPlace();
|
| D | UpperBidiagonalization.h | 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper()
|
| /external/eigen/Eigen/src/plugins/ |
| D | BlockMethods.h | 602 inline ColsBlockXpr leftCols(Index n) in leftCols() function
609 inline ConstColsBlockXpr leftCols(Index n) const in leftCols() function
631 inline typename NColsBlockXpr<N>::Type leftCols(Index n = N)
639 inline typename ConstNColsBlockXpr<N>::Type leftCols(Index n = N) const
|
| /external/eigen/doc/ |
| D | TutorialBlockOperations.dox | 157 \link DenseBase::leftCols() * \endlink</td>
159 matrix.leftCols(p);\endcode </td>
161 matrix.leftCols<p>();\endcode </td>
|
| D | AsciiQuickReference.txt | 64 P.leftCols<cols>() // P(:, 1:cols)
65 P.leftCols(cols) // P(:, 1:cols)
|
| D | FunctionsTakingEigenTypes.dox | 108 cov(m1.leftCols<3>(), m2.leftCols<3>(), m3.topLeftCorner<3,3>());
|
| D | SparseQuickReference.dox | 207 sm1.leftCols(size); // RW
|
| /external/tensorflow/tensorflow/core/util/ctc/ |
| D | ctc_loss_calculator.h | 211 Matrix y_b = y.leftCols(seq_len(b)); in CalculateLoss()
494 auto dy_b = dy->leftCols(y.cols()); in CalculateGradient()
|
| /external/eigen/Eigen/src/Geometry/ |
| D | Homogeneous.h | 378 …dst.template leftCols<ArgType::ColsAtCompileTime>(src.nestedExpression().cols()) = src.nestedExpre…
472 …: Base( xpr.lhs().template leftCols<helper::Dim>(xpr.rhs().nestedExpression().rows()) .lazyProdu…
|
| /external/eigen/Eigen/src/QR/ |
| D | HouseholderQR.h | 359 m_qr.leftCols(rank), in _solve_impl()
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| D | SplineFitting.h | 198 …chord_lengths.rightCols(n-1) = (pts.array().leftCols(n-1) - pts.array().rightCols(n-1)).matrix().c… in ChordLengths()
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | EigenSolver.h | 615 m_tmp.noalias() = m_eivec.leftCols(j+1) * m_matT.col(j).segment(0, j+1); in doComputeEigenvectors()
|