| /external/eigen/test/ |
| D | schur_complex.cpp | 24 ComplexMatrixType U = schurOfA.matrixU(); in schur()
37 VERIFY_RAISES_ASSERT(csUninitialized.matrixU()); in schur()
48 VERIFY_IS_EQUAL(cs1.matrixU(), cs2.matrixU()); in schur()
55 VERIFY_IS_EQUAL(cs3.matrixU(), cs1.matrixU()); in schur()
65 VERIFY_IS_EQUAL(cs3.matrixU(), ComplexMatrixType::Identity(size, size)); in schur()
71 VERIFY_RAISES_ASSERT(csOnlyT.matrixU()); in schur()
|
| D | schur_real.cpp | 47 MatrixType U = schurOfA.matrixU(); in schur()
56 VERIFY_RAISES_ASSERT(rsUninitialized.matrixU()); in schur()
67 VERIFY_IS_EQUAL(rs1.matrixU(), rs2.matrixU()); in schur()
74 VERIFY_IS_EQUAL(rs3.matrixU(), rs1.matrixU()); in schur()
86 VERIFY_IS_EQUAL(rs3.matrixU(), MatrixType::Identity(size, size)); in schur()
92 VERIFY_RAISES_ASSERT(rsOnlyT.matrixU()); in schur()
|
| D | svd_common.h | 42 MatrixUType u = svd.matrixU(); in svd_check_full()
82 VERIFY( (svd.matrixU().adjoint()*svd.matrixU()).isIdentity(prec) ); in svd_compare_to_full()
83 …VERIFY_IS_APPROX( svd.matrixU().leftCols(diagSize) * svd.singularValues().cwiseAbs2().asDiagonal()… in svd_compare_to_full()
84 …referenceSvd.matrixU().leftCols(diagSize) * referenceSvd.singularValues().cwiseAbs2().asDiagonal()… in svd_compare_to_full()
91 if(computationOptions & ComputeFullU) VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); in svd_compare_to_full()
92 …if(computationOptions & ComputeThinU) VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().left… 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()
415 VERIFY_RAISES_ASSERT(svd2.matrixU()); in svd_preallocate()
418 VERIFY_IS_APPROX(svd2.matrixU(), Matrix3f::Identity()); in svd_preallocate()
429 VERIFY_IS_APPROX(svd2.matrixU(), Matrix3f::Identity()); in svd_preallocate()
[all …]
|
| D | bdcsvd.cpp | 46 VERIFY_RAISES_ASSERT(m.bdcSvd().matrixU()); in bdcsvd_method()
59 if(computationOptions & ComputeFullU) VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU()); in compare_bdc_jacobi()
60 if(computationOptions & ComputeThinU) VERIFY_IS_APPROX(bdc_svd.matrixU(), jacobi_svd.matrixU()); in compare_bdc_jacobi()
|
| D | cholesky.cpp | 123 …RIFY_IS_APPROX(MatrixType(chollo.matrixL().transpose().conjugate()), MatrixType(chollo.matrixU())); in cholesky()
124 …VERIFY_IS_APPROX(MatrixType(chollo.matrixU().transpose().conjugate()), MatrixType(chollo.matrixL()… in cholesky()
125 …RIFY_IS_APPROX(MatrixType(cholup.matrixL().transpose().conjugate()), MatrixType(cholup.matrixU())); in cholesky()
126 …VERIFY_IS_APPROX(MatrixType(cholup.matrixU().transpose().conjugate()), MatrixType(cholup.matrixL()… in cholesky()
189 …RIFY_IS_APPROX(MatrixType(ldltlo.matrixL().transpose().conjugate()), MatrixType(ldltlo.matrixU())); in cholesky()
190 …VERIFY_IS_APPROX(MatrixType(ldltlo.matrixU().transpose().conjugate()), MatrixType(ldltlo.matrixL()… in cholesky()
191 …RIFY_IS_APPROX(MatrixType(ldltup.matrixL().transpose().conjugate()), MatrixType(ldltup.matrixU())); in cholesky()
192 …VERIFY_IS_APPROX(MatrixType(ldltup.matrixU().transpose().conjugate()), MatrixType(ldltup.matrixL()… in cholesky()
463 VERIFY_RAISES_ASSERT(llt.matrixU()) in cholesky_verify_assert()
|
| D | jacobisvd.cpp | 68 VERIFY_RAISES_ASSERT(m.jacobiSvd().matrixU()); in jacobisvd_method()
|
| /external/eigen/lapack/ |
| D | 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/Eigenvalues/ |
| D | GeneralizedSelfAdjointEigenSolver.h | 186 cholB.matrixU().template solveInPlace<OnTheRight>(matC); in compute()
192 cholB.matrixU().solveInPlace(Base::m_eivec); in compute()
199 matC = cholB.matrixU() * matC; in compute()
205 cholB.matrixU().solveInPlace(Base::m_eivec); in compute()
212 matC = cholB.matrixU() * matC; in compute()
|
| D | ComplexEigenSolver.h | 317 m_eivec.noalias() = m_schur.matrixU() * m_matX; in doComputeEigenvectors()
|
| /external/eigen/doc/snippets/ |
| D | RealSchur_RealSchur_MatrixType.cpp | 5 cout << "The orthogonal matrix U is:" << endl << schur.matrixU() << endl;
8 MatrixXd U = schur.matrixU();
|
| D | ComplexSchur_matrixU.cpp | 4 cout << "The unitary matrix U is:" << endl << schurOfA.matrixU() << endl;
|
| D | JacobiSVD_basic.cpp | 5 cout << "Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU() …
|
| /external/eigen/Eigen/src/Geometry/ |
| D | 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();
|
| D | Transform.h | 1083 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1
1089 LinearMatrixType m(svd.matrixU());
1112 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1
1115 if(scaling) scaling->lazyAssign(svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint());
1118 LinearMatrixType m(svd.matrixU());
|
| /external/eigen/unsupported/test/ |
| D | matrix_functions.h | 50 processTriangularMatrix<MatrixType>::run(result, T, schur.matrixU());
|
| D | matrix_power.cpp | 117 const MatrixType& U = schur.matrixU(); in testSingular()
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| D | SimplicialCholesky.h | 176 derived().matrixU().solveInPlace(dest);
358 inline const MatrixU matrixU() const {
455 inline const MatrixU matrixU() const {
|
| /external/eigen/Eigen/src/Cholesky/ |
| D | LDLT.h | 141 inline typename Traits::MatrixU matrixU() const in matrixU() function
588 matrixU().solveInPlace(dst);
634 res = matrixU() * res;
|
| D | LLT.h | 115 inline typename Traits::MatrixU matrixU() const in matrixU() function
497 matrixU().solveInPlace(bAndX);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixSquareRoot.h | 267 const MatrixType& U = schurOfA.matrixU();
292 const MatrixType& U = schurOfA.matrixU();
|
| /external/eigen/Eigen/src/SVD/ |
| D | SVDBase.h | 83 const MatrixUType& matrixU() const in matrixU() function
|
| D | BDCSVD.h | 253 if(computeU()) m_matrixU = jsvd.matrixU();
412 m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = b.matrixU();
415 m_naiveU.row(0).segment(firstCol, n + 1).real() = b.matrixU().row(0);
416 m_naiveU.row(1).segment(firstCol, n + 1).real() = b.matrixU().row(n);
|
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU.h | 156 …SparseLUMatrixUReturnType<SCMatrix,MappedSparseMatrix<Scalar,ColMajor,StorageIndex> > matrixU() co… in matrixU() function
234 this->matrixU().solveInPlace(X); in _solve_impl()
|
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| 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, Dyn…
|
| /external/eigen/doc/ |
| D | AsciiQuickReference.txt | 205 // .lu() -> .matrixL() and .matrixU()
207 // .svd() -> .matrixU(), .singularValues(), and .matrixV()
|