HomeSort by relevance Sort by last modified time
    Searched refs:matrixU (Results 1 - 25 of 35) sorted by null

1 2

  /external/eigen/doc/snippets/
ComplexSchur_matrixU.cpp 4 cout << "The unitary matrix U is:" << endl << schurOfA.matrixU() << endl;
RealSchur_RealSchur_MatrixType.cpp 5 cout << "The orthogonal matrix U is:" << endl << schur.matrixU() << endl;
8 MatrixXd U = schur.matrixU();
JacobiSVD_basic.cpp 5 cout << "Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU() << endl;
  /external/eigen/test/
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());
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());
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...]
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()));
363 VERIFY_RAISES_ASSERT(llt.matrixU())
  /external/eigen/Eigen/src/Eigenvalues/
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;
ComplexEigenSolver.h 312 m_eivec.noalias() = m_schur.matrixU() * m_matX;
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
  /external/eigen/unsupported/test/
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...]
bdcsvd.cpp 93 VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU());
95 VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU());
jacobisvd.cpp 99 VERIFY_RAISES_ASSERT(m.jacobiSvd().matrixU());
  /external/eigen/Eigen/src/Geometry/
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();
Transform.h     [all...]
  /external/eigen/test/eigen2/
eigen2_svd.cpp 37 matU.block(0,0,rows,cols) = svd.matrixU();
  /external/eigen/unsupported/Eigen/src/SVD/
BDCSVD.h 167 const MatrixUType& matrixU() const
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()
SVDBase.h 110 const MatrixUType& matrixU() const
  /external/eigen/Eigen/src/Eigen2Support/Geometry/
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/
LDLT.h 120 inline typename Traits::MatrixU matrixU() const
422 typedef const TriangularView<const typename MatrixType::AdjointReturnType, UnitUpper> MatrixU;
424 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
430 typedef const TriangularView<const MatrixType, UnitUpper> MatrixU;
432 static inline MatrixU getU(const MatrixType& m) { return m; }
531 dec().matrixU().solveInPlace(dst);
578 res = matrixU() * res;
LLT.h 97 inline typename Traits::MatrixU matrixU() const
364 typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU;
366 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
374 typedef const TriangularView<const MatrixType, Upper> MatrixU;
376 static inline MatrixU getU(const MatrixType& m) { return m; }
463 matrixU().solveInPlace(bAndX);
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 173 derived().matrixU().solveInPlace(dest);
259 typedef SparseTriangularView<typename CholMatrixType::AdjointReturnType, Eigen::Upper> MatrixU;
261 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
273 typedef SparseTriangularView<typename CholMatrixType::AdjointReturnType, Eigen::UnitUpper> MatrixU;
275 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
319 typedef typename Traits::MatrixU MatrixU;
334 inline const MatrixU matrixU() const {
408 typedef typename Traits::MatrixU MatrixU
    [all...]
  /external/eigen/unsupported/Eigen/src/Eigenvalues/
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/
MatrixSquareRoot.h 355 const MatrixType& U = schurOfA.matrixU();
388 const MatrixType& U = schurOfA.matrixU();
  /external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h 183 inline const LUMatrixType& matrixU() const

Completed in 590 milliseconds

1 2