/external/eigen/doc/snippets/ |
H A D | ComplexSchur_matrixU.cpp | 4 cout << "The unitary matrix U is:" << endl << schurOfA.matrixU() << endl;
|
H A D | RealSchur_RealSchur_MatrixType.cpp | 5 cout << "The orthogonal matrix U is:" << endl << schur.matrixU() << endl; 8 MatrixXd U = schur.matrixU();
|
H A D | JacobiSVD_basic.cpp | 5 cout << "Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU() << endl;
|
/external/eigen/test/ |
H A D | schur_complex.cpp | 24 ComplexMatrixType U = schurOfA.matrixU(); 37 VERIFY_RAISES_ASSERT(csUninitialized.matrixU()); 48 VERIFY_IS_EQUAL(cs1.matrixU(), cs2.matrixU()); 55 VERIFY_IS_EQUAL(cs3.matrixU(), cs1.matrixU()); 65 VERIFY_IS_EQUAL(cs3.matrixU(), ComplexMatrixType::Identity(size, size)); 71 VERIFY_RAISES_ASSERT(csOnlyT.matrixU());
|
H A D | schur_real.cpp | 47 MatrixType U = schurOfA.matrixU(); 56 VERIFY_RAISES_ASSERT(rsUninitialized.matrixU()); 67 VERIFY_IS_EQUAL(rs1.matrixU(), rs2.matrixU()); 74 VERIFY_IS_EQUAL(rs3.matrixU(), rs1.matrixU()); 86 VERIFY_IS_EQUAL(rs3.matrixU(), MatrixType::Identity(size, size)); 92 VERIFY_RAISES_ASSERT(rsOnlyT.matrixU());
|
H A D | jacobisvd.cpp | 35 MatrixUType u = svd.matrixU(); 57 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); 59 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); 206 VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint()); 255 VERIFY_RAISES_ASSERT(svd.matrixU()) 263 VERIFY_RAISES_ASSERT(svd.matrixU()) 271 svd.matrixU(); 277 VERIFY_RAISES_ASSERT(svd.matrixU()) [all...] |
H A D | cholesky.cpp | 113 VERIFY_IS_APPROX(MatrixType(chollo.matrixL().transpose().conjugate()), MatrixType(chollo.matrixU())); 114 VERIFY_IS_APPROX(MatrixType(chollo.matrixU().transpose().conjugate()), MatrixType(chollo.matrixL())); 115 VERIFY_IS_APPROX(MatrixType(cholup.matrixL().transpose().conjugate()), MatrixType(cholup.matrixU())); 116 VERIFY_IS_APPROX(MatrixType(cholup.matrixU().transpose().conjugate()), MatrixType(cholup.matrixL())); 160 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixL().transpose().conjugate()), MatrixType(ldltlo.matrixU())); 161 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixU().transpose().conjugate()), MatrixType(ldltlo.matrixL())); 162 VERIFY_IS_APPROX(MatrixType(ldltup.matrixL().transpose().conjugate()), MatrixType(ldltup.matrixU())); 163 VERIFY_IS_APPROX(MatrixType(ldltup.matrixU().transpose().conjugate()), MatrixType(ldltup.matrixL())); 361 VERIFY_RAISES_ASSERT(llt.matrixU())
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | GeneralizedSelfAdjointEigenSolver.h | 187 cholB.matrixU().template solveInPlace<OnTheRight>(matC); 193 cholB.matrixU().solveInPlace(Base::m_eivec); 200 matC = cholB.matrixU() * matC; 206 cholB.matrixU().solveInPlace(Base::m_eivec); 213 matC = cholB.matrixU() * matC;
|
H A D | ComplexEigenSolver.h | 304 m_eivec.noalias() = m_schur.matrixU() * m_matX;
|
H A D | ComplexSchur.h | 44 * decomposition is computed, you can use the matrixU() and matrixT() 110 * \sa matrixT() and matrixU() for examples. 137 const ComplexMatrixType& matrixU() const function in class:Eigen::ComplexSchur
|
/external/eigen/unsupported/test/ |
H A D | svd_common.h | 44 MatrixUType u = svd.matrixU(); 68 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); 70 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); 135 VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint()); 155 VERIFY_RAISES_ASSERT(svd.matrixU()) 162 VERIFY_RAISES_ASSERT(svd.matrixU()) 170 svd.matrixU(); 175 VERIFY_RAISES_ASSERT(svd.matrixU()) [all...] |
H A D | bdcsvd.cpp | 93 VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU()); 95 VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU());
|
H A D | jacobisvd.cpp | 99 VERIFY_RAISES_ASSERT(m.jacobiSvd().matrixU());
|
/external/eigen/Eigen/src/Geometry/ |
H A D | Umeyama.h | 145 if ( svd.matrixU().determinant() * svd.matrixV().determinant() > Scalar(0) ) { 146 Rt.block(0,0,m,m).noalias() = svd.matrixU()*svd.matrixV().transpose(); 149 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose(); 153 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose();
|
H A D | Transform.h | 1023 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 1029 LinearMatrixType m(svd.matrixU()); 1052 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 1055 if(scaling) scaling->lazyAssign(svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint()); 1058 LinearMatrixType m(svd.matrixU());
|
/external/eigen/test/eigen2/ |
H A D | eigen2_svd.cpp | 37 matU.block(0,0,rows,cols) = svd.matrixU();
|
/external/eigen/unsupported/Eigen/src/SVD/ |
H A D | BDCSVD.h | 167 const MatrixUType& matrixU() const function in class:Eigen::BDCSVD 382 if (compU) m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() << b.matrixU(); 385 m_naiveU.row(0).segment(firstCol, n + 1).real() << b.matrixU().row(0); 386 m_naiveU.row(1).segment(firstCol, n + 1).real() << b.matrixU().row(n); 488 if (compU) m_naiveU.block(firstCol, firstCol, n + 1, n + 1) *= res.matrixU(); 489 else m_naiveU.block(0, firstCol, 2, n + 1) *= res.matrixU(); 722 * dec().matrixU().leftCols(diagSize).adjoint()
|
H A D | SVDBase.h | 110 const MatrixUType& matrixU() const function in class:Eigen::SVDBase
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | Transform.h | 622 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 631 LinearMatrixType m(svd.matrixU()); 653 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 658 scaling->noalias() = svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint(); 662 LinearMatrixType m(svd.matrixU());
|
/external/eigen/Eigen/src/Cholesky/ |
H A D | LDLT.h | 120 inline typename Traits::MatrixU matrixU() const function in class:Eigen::LDLT 524 dec().matrixU().solveInPlace(dst); 571 res = matrixU() * res;
|
H A D | LLT.h | 97 inline typename Traits::MatrixU matrixU() const function in class:Eigen::LLT 455 matrixU().solveInPlace(bAndX);
|
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky.h | 173 derived().matrixU().solveInPlace(dest); 334 inline const MatrixU matrixU() const { function in class:Eigen::SimplicialLLT 429 inline const MatrixU matrixU() const { function in class:Eigen::SimplicialLDLT
|
/external/eigen/unsupported/Eigen/src/Eigenvalues/ |
H A D | ArpackSelfAdjointEigenSolver.h | 762 Matrix<Scalar, Dynamic, 1>::Map(out, n) = OP.matrixU().solve(Matrix<Scalar, Dynamic, 1>::Map(in, n)); 779 Matrix<Scalar, Dynamic, Dynamic>::Map(vecs, n, k) = OP.matrixU().solve(Matrix<Scalar, Dynamic, Dynamic>::Map(vecs, n, k));
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
H A D | MatrixSquareRoot.h | 355 const MatrixType& U = schurOfA.matrixU(); 388 const MatrixType& U = schurOfA.matrixU();
|
/external/eigen/Eigen/src/UmfPackSupport/ |
H A D | UmfPackSupport.h | 173 inline const LUMatrixType& matrixU() const function in class:Eigen::UmfPackLU
|