HomeSort by relevance Sort by last modified time
    Searched refs:ComputeThinU (Results 1 - 5 of 5) sorted by null

  /external/eigen/doc/examples/
TutorialLinAlgSVDSolve.cpp 14 << A.jacobiSvd(ComputeThinU | ComputeThinV).solve(b) << endl;
  /external/eigen/doc/snippets/
JacobiSVD_basic.cpp 3 JacobiSVD<MatrixXf> svd(m, ComputeThinU | ComputeThinV);
  /external/eigen/test/
jacobisvd.cpp 61 if(computationOptions & ComputeThinU)
113 jacobisvd_compare_to_full(m, ComputeThinU|ComputeFullV, fullSvd);
114 jacobisvd_compare_to_full(m, ComputeThinU , fullSvd);
115 jacobisvd_compare_to_full(m, ComputeThinU|ComputeThinV, fullSvd);
117 jacobisvd_solve<MatrixType, QRPreconditioner>(m, ComputeThinU | ComputeFullV);
118 jacobisvd_solve<MatrixType, QRPreconditioner>(m, ComputeThinU | ComputeThinV);
123 JacobiSVD<MatrixType, QRPreconditioner> svd(m, ComputeThinU | ComputeThinV);
171 svd.compute(a, ComputeThinU);
183 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeThinV))
184 VERIFY_RAISES_ASSERT(svd_fullqr.compute(a, ComputeThinU|ComputeFullV)
    [all...]
  /external/eigen/Eigen/src/Core/util/
Constants.h 322 ComputeThinU = 0x08,
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 541 * By default, none is computed. This is a bit-field, the possible bits are #ComputeFullU, #ComputeThinU,
560 * By default, none is computed. This is a bit-field, the possible bits are #ComputeFullU, #ComputeThinU,
582 * the U matrix is n-by-n if you asked for #ComputeFullU, and is n-by-m if you asked for #ComputeThinU.
697 m_computeThinU = (computationOptions & ComputeThinU) != 0;
    [all...]

Completed in 46 milliseconds