| /external/eigen/doc/snippets/ |
| D | MatrixBase_leftCols_int.cpp | 4 cout << a.leftCols(2) << endl;
5 a.leftCols(2).setZero();
|
| D | MatrixBase_template_int_leftCols.cpp | 4 cout << a.leftCols<2>() << endl;
5 a.leftCols<2>().setZero();
|
| /external/eigen/Eigen/src/misc/ |
| D | SparseSolve.h | 62 tmp.leftCols(actualCols) = m_rhs.middleCols(k,actualCols);
63 tmpX.leftCols(actualCols) = m_dec.solve(tmp.leftCols(actualCols));
64 dst.middleCols(k,actualCols) = tmpX.leftCols(actualCols).sparseView();
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | DGMRES.h | 376 tv1 = m_V.leftCols(it) * nrs;
381 x = x + precond.solve(m_V.leftCols(it) * nrs);
474 X = m_V.leftCols(it) * Sr;
499 m_T.block(0, m_r, m_r, nbrEig) = m_U.leftCols(m_r).transpose() * MX;
500 m_T.block(m_r, 0, nbrEig, m_r) = X.transpose() * m_MU.leftCols(m_r);
520 DenseVector x1 = m_U.leftCols(m_r).transpose() * x;
521 y = x + m_U.leftCols(m_r) * ( m_lambdaN * m_luT.solve(x1) - x1);
|
| /external/eigen/unsupported/test/ |
| D | svd_common.h | 70 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); in svd_compare_to_full()
74 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV().leftCols(diagSize)); in svd_compare_to_full()
135 …VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.mat… in svd_test_computation_options_2()
|
| /external/eigen/test/ |
| 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 | jacobisvd.cpp | 59 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); in jacobisvd_compare_to_full()
63 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV().leftCols(diagSize)); in jacobisvd_compare_to_full()
206 …VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.mat… in jacobisvd_test_all_computation_options()
|
| D | product.h | 148 VERIFY_IS_APPROX(m1.leftCols(1) * m1.row(r), m1.block(0,0,rows,1) * m1.block(r,0,1,cols)); in product()
|
| /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/plugins/ |
| D | BlockMethods.h | 526 inline ColsBlockXpr leftCols(Index n) in leftCols() function
532 inline ConstColsBlockXpr leftCols(Index n) const in leftCols() function
551 inline typename NColsBlockXpr<N>::Type leftCols(Index n = N)
558 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 | 62 P.leftCols<cols>() // P(:, 1:cols)
63 P.leftCols(cols) // P(:, 1:cols)
|
| D | FunctionsTakingEigenTypes.dox | 108 cov(m1.leftCols<3>(), m2.leftCols<3>(), m3.topLeftCorner<3,3>());
|
| D | SparseQuickReference.dox | 204 sm1.leftCols(size);
|
| D | QuickReference.dox | 507 mat1.leftCols(cols)
512 mat1.leftCols<cols>()
|
| D | A05_PortingFrom2To3.dox | 77 Notice that Eigen3 also provides these new convenience methods: topRows(), bottomRows(), leftCols()…
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| D | SplineFitting.h | 71 …chord_lengths.rightCols(n-1) = (pts.array().leftCols(n-1) - pts.array().rightCols(n-1)).matrix().c… in ChordLengths()
|
| /external/eigen/Eigen/src/QR/ |
| D | HouseholderQR.h | 321 dec().matrixQR().leftCols(rank),
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| D | JacobiSVD.h | 758 dst = dec().matrixV().leftCols(diagSize)
760 * dec().matrixU().leftCols(diagSize).adjoint()
|
| D | BDCSVD.h | 720 dst = dec().matrixV().leftCols(diagSize)
722 * dec().matrixU().leftCols(diagSize).adjoint()
|
| /external/eigen/Eigen/src/SVD/ |
| D | JacobiSVD.h | 946 tmp.noalias() = dec().matrixU().leftCols(rank).adjoint() * rhs();
948 dst = dec().matrixV().leftCols(rank) * tmp;
|
| /external/eigen/Eigen/src/LU/ |
| D | FullPivLU.h | 525 res = m_lu.leftCols(smalldim) in reconstructedMatrix()
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | EigenSolver.h | 591 m_tmp.noalias() = m_eivec.leftCols(j+1) * m_matT.col(j).segment(0, j+1); in doComputeEigenvectors()
|
| /external/eigen/Eigen/src/Geometry/ |
| D | Transform.h | 1445 ResultType res(lhs.matrix().template leftCols<Dim>() * rhs.matrix());
|