/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexSchur.h | 106 * \param[in] computeU If true, both T and U are computed; if false, only T is computed. 112 ComplexSchur(const MatrixType& matrix, bool computeU = true) 120 compute(matrix, computeU); 128 * ComplexSchur(const MatrixType& matrix, bool computeU) or the 129 * member function compute(const MatrixType& matrix, bool computeU) 131 * matrix, and that \p computeU was set to true (the default 149 * ComplexSchur(const MatrixType& matrix, bool computeU) or the 150 * member function compute(const MatrixType& matrix, bool computeU) 170 * \param[in] computeU If true, both T and U are computed; if false, only T is computed. 182 * if \a computeU i 316 compute(const MatrixType& matrix, bool computeU) argument 338 computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) argument 353 run(ComplexSchur<MatrixType>& _this, const MatrixType& matrix, bool computeU) argument 364 run(ComplexSchur<MatrixType>& _this, const MatrixType& matrix, bool computeU) argument 384 reduceToTriangularForm(bool computeU) argument [all...] |
H A D | 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; \
|
H A D | 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; \
|
H A D | RealSchur.h | 96 * \param[in] computeU If true, both T and U are computed; if false, only T is computed. 103 RealSchur(const MatrixType& matrix, bool computeU = true) 112 compute(matrix, computeU); 121 * to compute the Schur decomposition of a matrix, and \p computeU was set 152 * \param[in] computeU If true, both T and U are computed; if false, only T is computed. 160 * may be taken to be \f$25n^3\f$ flops if \a computeU is true and 161 * \f$10n^3\f$ flops if \a computeU is false. 168 RealSchur& compute(const MatrixType& matrix, bool computeU = true); 173 * \param computeU Computes the matriX U of the Schur vectors 179 * When computeU i 246 compute(const MatrixType& matrix, bool computeU) argument 263 computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) argument 364 splitOffTwoRows(Index iu, bool computeU, const Scalar& exshift) argument 468 performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace) argument [all...] |
/external/eigen/Eigen/src/SVD/ |
H A D | JacobiSVD.h | 141 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); 240 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); 339 if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows()); 383 if(svd.computeU()) svd.m_matrixU.col(p) *= conj(z); 388 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); 397 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); 408 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); 616 eigen_assert(computeU() && "This JacobiSVD decomposition didn't compute U. Did you ask for it?"); 648 inline bool computeU() const { return m_computeFullU || m_computeThinU; } function in class:Eigen::JacobiSVD 666 eigen_assert(computeU() [all...] |
H A D | JacobiSVD_MKL.h | 61 if (computeU()) { \
|
/external/eigen/unsupported/Eigen/src/SVD/ |
H A D | SVDBase.h | 113 eigen_assert(computeU() && "This SVD decomposition didn't compute U. Did you ask for it?"); 155 inline bool computeU() const { return m_computeFullU || m_computeThinU; } function in class:Eigen::SVDBase
|
H A D | JacobiSVD.h | 141 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); 240 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); 339 if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows()); 382 if(svd.computeU()) svd.m_matrixU.col(p) *= conj(z); 385 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); 392 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); 403 if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); 599 eigen_assert(SVDBase<MatrixType>::computeU() && SVDBase<MatrixType>::computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice)."); 693 if(SVDBase<MatrixType>::computeU()) this->m_matrixU.applyOnTheRight(p,q,j_left.transpose()); 708 if(SVDBase<MatrixType>::computeU() [all...] |
H A D | BDCSVD.h | 161 eigen_assert(SVDBase<_MatrixType>::computeU() && SVDBase<_MatrixType>::computeV() && 176 eigen_assert(this->computeU() && "This SVD decomposition didn't compute U. Did you ask for it?"); 187 eigen_assert(this->computeU() && "This SVD decomposition didn't compute V. Did you ask for it?"); 224 compU = this->computeU(); 229 compV = this->computeU(); 241 if (this->computeU()||this->computeV()){ 318 if (this->computeU()){
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | DGMRES.h | 438 bool computeU = true; local 441 schurofH.computeFromHessenberg(m_Hes.topLeftCorner(it,it), matrixQ, computeU);
|