| /external/eigen/Eigen/src/Eigen2Support/ |
| H A D | QR.h | 36 MatrixType matrixQ(void) const { function in class:Eigen::QR
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| H A D | ComplexSchur.h | 193 * \param[in] matrixQ orthogonal matrix Q that transform a matrix A to H : A = Q H Q^T
209 ComplexSchur& computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU=true);
338 ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) argument
342 m_matU = matrixQ;
357 if(computeU) _this.m_matU = _this.m_hess.matrixQ();
374 MatrixType Q = _this.m_hess.matrixQ();
|
| H A D | HessenbergDecomposition.h | 49 * computed, you can use the matrixH() and matrixQ() functions to construct
84 /** \brief Return type of matrixQ() */
232 HouseholderSequenceType matrixQ() const function in class:Eigen::HessenbergDecomposition
258 * \sa matrixQ(), packedMatrix()
|
| H A D | Tridiagonalization.h | 53 * matrixQ() and matrixT() functions to retrieve the matrices Q and T in the
98 /** \brief Return type of matrixQ() */
238 HouseholderSequenceType matrixQ() const function in class:Eigen::Tridiagonalization
261 * matrixQ(), packedMatrix(), diagonal(), subDiagonal()
|
| H A D | RealSchur.h | 172 * \param[in] matrixQ orthogonal matrix Q that transform a matrix A to H : A = Q H Q^T
188 RealSchur& computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU);
257 computeFromHessenberg(m_hess.matrixH(), m_hess.matrixQ(), computeU);
263 RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) argument
267 m_matU = matrixQ;
|
| H A D | RealQZ.h | 43 * matrixT(), matrixQ() and matrixZ() functions to retrieve the matrices
119 const MatrixType& matrixQ() const { function in class:Eigen::RealQZ
|
| H A D | SelfAdjointEigenSolver.h | 380 static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n);
740 static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n) argument
789 if (matrixQ)
792 Map<Matrix<Scalar,Dynamic,Dynamic,StorageOrder> > q(matrixQ,n,n);
|
| /external/eigen/Eigen/src/QR/ |
| H A D | ColPivHouseholderQR.h | 149 HouseholderSequenceType matrixQ(void) const function in class:Eigen::ColPivHouseholderQR
|
| H A D | FullPivHouseholderQR.h | 157 MatrixQReturnType matrixQ(void) const;
533 * \brief Expression type for return value of FullPivHouseholderQR::matrixQ()
595 inline typename FullPivHouseholderQR<MatrixType>::MatrixQReturnType FullPivHouseholderQR<MatrixType>::matrixQ() const function in class:Eigen::FullPivHouseholderQR
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| H A D | SuiteSparseQRSupport.h | 46 * Use matrixQ() to get an expression and matrixQ().transpose() to get the transpose.
151 y = matrixQ().transpose() * b;
174 SPQRMatrixQReturnType<SPQR> matrixQ() const function in class:Eigen::SPQR
|
| /external/eigen/Eigen/src/SparseQR/ |
| H A D | SparseQR.h | 51 * Use matrixQ() to get an expression and matrixQ().transpose() to get the transpose.
133 * B2 = matrixQ() * B1;
139 * Q = SparseQR<SparseMatrix<double> >(A).matrixQ();
146 SparseQRMatrixQReturnType<SparseQR> matrixQ() const function in class:Eigen::SparseQR
174 y = this->matrixQ().transpose() * B;
657 dest.derived() = m_qr.matrixQ() * Dest::Identity(m_qr.rows(), m_qr.rows());
|
| /external/opencv/cv/src/ |
| H A D | cvgeometry.cpp | 355 cvRQDecomp3x3( const CvMat *matrixM, CvMat *matrixR, CvMat *matrixQ, argument
369 CV_ASSERT( CV_IS_MAT(matrixM) && CV_IS_MAT(matrixR) && CV_IS_MAT(matrixQ) &&
371 CV_ARE_SIZES_EQ(matrixM, matrixR) && CV_ARE_SIZES_EQ(matrixM, matrixQ));
513 cvConvert( &Q, matrixQ );
|