Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:matrixU (Results 1 - 25 of 32) 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());
bdcsvd.cpp	46 VERIFY_RAISES_ASSERT(m.bdcSvd().matrixU()); 59 if(computationOptions & ComputeFullU) VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU()); 60 if(computationOptions & ComputeThinU) VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU());
svd_common.h	42 MatrixUType u = svd.matrixU(); 82 VERIFY( (svd.matrixU().adjoint()*svd.matrixU()).isIdentity(prec) ); 83 VERIFY_IS_APPROX( svd.matrixU().leftCols(diagSize) * svd.singularValues().cwiseAbs2().asDiagonal() * svd.matrixU().leftCols(diagSize).adjoint(), 84 referenceSvd.matrixU().leftCols(diagSize) * referenceSvd.singularValues().cwiseAbs2().asDiagonal() * referenceSvd.matrixU().leftCols(diagSize).adjoint()); 91 if(computationOptions & ComputeFullU) VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); 92 if(computationOptions & ComputeThinU) VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize))     [all...]
cholesky.cpp	123 VERIFY_IS_APPROX(MatrixType(chollo.matrixL().transpose().conjugate()), MatrixType(chollo.matrixU())); 124 VERIFY_IS_APPROX(MatrixType(chollo.matrixU().transpose().conjugate()), MatrixType(chollo.matrixL())); 125 VERIFY_IS_APPROX(MatrixType(cholup.matrixL().transpose().conjugate()), MatrixType(cholup.matrixU())); 126 VERIFY_IS_APPROX(MatrixType(cholup.matrixU().transpose().conjugate()), MatrixType(cholup.matrixL())); 189 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixL().transpose().conjugate()), MatrixType(ldltlo.matrixU())); 190 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixU().transpose().conjugate()), MatrixType(ldltlo.matrixL())); 191 VERIFY_IS_APPROX(MatrixType(ldltup.matrixL().transpose().conjugate()), MatrixType(ldltup.matrixU())); 192 VERIFY_IS_APPROX(MatrixType(ldltup.matrixU().transpose().conjugate()), MatrixType(ldltup.matrixL())); 463 VERIFY_RAISES_ASSERT(llt.matrixU())
jacobisvd.cpp	68 VERIFY_RAISES_ASSERT(m.jacobiSvd().matrixU());
/external/eigen/Eigen/src/Eigenvalues/
GeneralizedSelfAdjointEigenSolver.h	186 cholB.matrixU().template solveInPlace<OnTheRight>(matC); 192 cholB.matrixU().solveInPlace(Base::m_eivec); 199 matC = cholB.matrixU() * matC; 205 cholB.matrixU().solveInPlace(Base::m_eivec); 212 matC = cholB.matrixU() * matC;
ComplexEigenSolver.h	317 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. 138 const ComplexMatrixType& matrixU() const
/external/eigen/lapack/
svd.cpp	62 matrix(u,*m,*m,*ldu) = svd.matrixU(); 67 matrix(u,*m,diag_size,*ldu) = svd.matrixU(); 72 matrix(a,*m,*n,*lda) = svd.matrixU(); 77 matrix(u,*m,*m,*ldu) = svd.matrixU(); 128 if(*jobu=='A') matrix(u,*m,*m,*ldu) = svd.matrixU(); 129 else if(*jobu=='S') matrix(u,*m,diag_size,*ldu) = svd.matrixU(); 130 else if(*jobu=='O') matrix(a,*m,diag_size,*lda) = svd.matrixU();
/external/eigen/Eigen/src/Geometry/
Umeyama.h	139 if ( svd.matrixU().determinant() * svd.matrixV().determinant() < 0 ) 143 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose();
Transform.h	[all...]
/external/eigen/unsupported/test/
matrix_functions.h	50 processTriangularMatrix<MatrixType>::run(result, T, schur.matrixU());
matrix_power.cpp	117 const MatrixType& U = schur.matrixU();
/external/eigen/Eigen/src/Cholesky/
LDLT.h	141 inline typename Traits::MatrixU matrixU() const 471 typedef const TriangularView<const typename MatrixType::AdjointReturnType, UnitUpper> MatrixU; 473 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } 479 typedef const TriangularView<const MatrixType, UnitUpper> MatrixU; 481 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } 588 matrixU().solveInPlace(dst); 634 res = matrixU() * res     [all...]
LLT.h	115 inline typename Traits::MatrixU matrixU() const 393 typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU; 395 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } 403 typedef const TriangularView<const MatrixType, Upper> MatrixU; 405 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } 497 matrixU().solveInPlace(bAndX);
/external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h	176 derived().matrixU().solveInPlace(dest); 281 typedef TriangularView<const typename CholMatrixType::AdjointReturnType, Eigen::Upper> MatrixU; 283 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } 295 typedef TriangularView<const typename CholMatrixType::AdjointReturnType, Eigen::UnitUpper> MatrixU; 297 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } 343 typedef typename Traits::MatrixU MatrixU; 358 inline const MatrixU matrixU() const     [all...]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixSquareRoot.h	267 const MatrixType& U = schurOfA.matrixU(); 292 const MatrixType& U = schurOfA.matrixU();
/external/eigen/Eigen/src/SVD/
SVDBase.h	83 const MatrixUType& matrixU() const
BDCSVD.h	252 if(computeU()) m_matrixU = jsvd.matrixU(); 411 m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = b.matrixU(); 414 m_naiveU.row(0).segment(firstCol, n + 1).real() = b.matrixU().row(0); 415 m_naiveU.row(1).segment(firstCol, n + 1).real() = b.matrixU().row(n);     [all...]
/external/eigen/Eigen/src/SparseLU/
SparseLU.h	153 * y = b; matrixU().solveInPlace(y); 156 SparseLUMatrixUReturnType<SCMatrix,MappedSparseMatrix<Scalar,ColMajor,StorageIndex> > matrixU() const 234 this->matrixU().solveInPlace(X);
/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));

Completed in 582 milliseconds

1 2