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

  /external/eigen/Eigen/src/Eigenvalues/
ComplexSchur_MKL.h 45 ComplexSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, bool computeU) \
58 if(computeU) m_matU = ComplexMatrixType::Identity(1,1); \
61 m_matUisUptodate = computeU; \
69 jobvs = (computeU) ? 'V' : 'N'; \
82 m_matUisUptodate = computeU; \
ComplexSchur.h 105 * \param[in] computeU If true, both T and U are computed; if false, only T is computed.
111 ComplexSchur(const MatrixType& matrix, bool computeU = true)
118 compute(matrix, computeU);
126 * ComplexSchur(const MatrixType& matrix, bool computeU) or the
127 * member function compute(const MatrixType& matrix, bool computeU)
129 * matrix, and that \p computeU was set to true (the default
147 * ComplexSchur(const MatrixType& matrix, bool computeU) or the
148 * member function compute(const MatrixType& matrix, bool computeU)
168 * \param[in] computeU If true, both T and U are computed; if false, only T is computed.
179 * if \a computeU is false
    [all...]
RealSchur_MKL.h 45 RealSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, bool computeU) \
58 jobvs = (computeU) ? 'V' : 'N'; \
71 m_matUisUptodate = computeU; \
RealSchur.h 95 * \param[in] computeU If true, both T and U are computed; if false, only T is computed.
102 RealSchur(const MatrixType& matrix, bool computeU = true)
110 compute(matrix, computeU);
119 * to compute the Schur decomposition of a matrix, and \p computeU was set
150 * \param[in] computeU If true, both T and U are computed; if false, only T is computed.
158 * may be taken to be \f$25n^3\f$ flops if \a computeU is true and
159 * \f$10n^3\f$ flops if \a computeU is false.
164 RealSchur& compute(const MatrixType& matrix, bool computeU = true);
196 void splitOffTwoRows(Index iu, bool computeU, Scalar exshift);
199 void performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace)
    [all...]
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 138 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
233 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
328 if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows());
369 if(svd.computeU()) svd.m_matrixU.col(p) *= conj(z);
372 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z);
379 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint());
390 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z);
591 eigen_assert(computeU() && "This JacobiSVD decomposition didn't compute U. Did you ask for it?");
623 inline bool computeU() const { return m_computeFullU || m_computeThinU; }
641 eigen_assert(computeU() && computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitar (…)
    [all...]
JacobiSVD_MKL.h 61 if (computeU()) { \

Completed in 71 milliseconds