Searched refs:computeU (Results 1 – 6 of 6) sorted by relevance
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | ComplexSchur.h | 111 ComplexSchur(const MatrixType& matrix, bool computeU = true)
118 compute(matrix, computeU);
184 ComplexSchur& compute(const MatrixType& matrix, bool computeU = true);
212 void reduceToTriangularForm(bool computeU);
271 ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const MatrixType& matrix, bool computeU)
279 if(computeU) m_matU = ComplexMatrixType::Identity(1,1);
282 m_matUisUptodate = computeU;
286 …schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>::run(*this, matrix, computeU);
287 reduceToTriangularForm(computeU);
298 static void run(ComplexSchur<MatrixType>& _this, const MatrixType& matrix, bool computeU)
[all …]
|
| D | RealSchur.h | 102 RealSchur(const MatrixType& matrix, bool computeU = true)
110 compute(matrix, computeU);
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& firstHouseh…
204 RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const MatrixType& matrix, bool computeU) in compute() argument
211 if (computeU) in compute()
244 splitOffTwoRows(iu, computeU, exshift); in compute()
257 performFrancisQRStep(il, im, iu, computeU, firstHouseholderVector, workspace); in compute()
267 m_matUisUptodate = computeU; in compute()
[all …]
|
| D | ComplexSchur_MKL.h | 45 … 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; \
|
| D | RealSchur_MKL.h | 45 … EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, bool computeU) \
58 jobvs = (computeU) ? 'V' : 'N'; \
71 m_matUisUptodate = computeU; \
|
| /external/eigen/Eigen/src/SVD/ |
| D | JacobiSVD.h | 138 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); in run()
233 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); in run()
328 if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows()); in run()
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…
[all …]
|
| D | JacobiSVD_MKL.h | 61 if (computeU()) { \
|