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

  /external/eigen/test/eigen2/
eigen2_qr.cpp 27 VERIFY_IS_APPROX(a, qrOfA.matrixQ() * qrOfA.matrixR());
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
35 VERIFY_IS_APPROX(b, tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint());
39 VERIFY_IS_APPROX(b, hess.matrixQ() * hess.matrixH() * hess.matrixQ().adjoint());
43 VERIFY_IS_APPROX(b, hess.matrixQ() * hess.matrixH() * hess.matrixQ().adjoint());
eigen2_hyperplane.cpp 52 MatrixType rot = MatrixType::Random(dim,dim).qr().matrixQ();
  /external/eigen/doc/snippets/
HessenbergDecomposition_matrixH.cpp 6 MatrixXf Q = hessOfA.matrixQ();
Tridiagonalization_Tridiagonalization_MatrixType.cpp 5 MatrixXd Q = triOfA.matrixQ();
  /external/eigen/test/
hessenberg.cpp 22 MatrixType Q = hess.matrixQ();
38 MatrixType cs1Q = cs1.matrixQ();
39 MatrixType cs2Q = cs2.matrixQ();
45 VERIFY_RAISES_ASSERT( hessUninitialized.matrixQ() );
qr_fullpivoting.cpp 35 MatrixQType q = qr.matrixQ();
41 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse();
82 m3 = qr.matrixQ(); // get a unitary
96 VERIFY_RAISES_ASSERT(qr.matrixQ())
eigensolver_selfadjoint.cpp 102 // FIXME tridiag.matrixQ().adjoint() does not work
103 VERIFY_IS_APPROX(MatrixType(symmA.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());
  /external/eigen/Eigen/src/Eigen2Support/
QR.h 36 MatrixType matrixQ(void) const {
  /external/eigen/Eigen/src/Eigenvalues/
HessenbergDecomposition.h 49 * computed, you can use the matrixH() and matrixQ() functions to construct
84 /** \brief Return type of matrixQ() */
232 HouseholderSequenceType matrixQ() const
258 * \sa matrixQ(), packedMatrix()
SelfAdjointEigenSolver.h 380 static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n);
737 static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n)
776 if (matrixQ)
779 Map<Matrix<Scalar,Dynamic,Dynamic,StorageOrder> > q(matrixQ,n,n);
ComplexSchur.h 302 if(computeU) _this.m_matU = _this.m_hess.matrixQ();
320 MatrixType Q = _this.m_hess.matrixQ();
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
261 * matrixQ(), packedMatrix(), diagonal(), subDiagonal()
RealSchur.h 212 m_matU = m_hess.matrixQ();
  /external/opencv/cv/src/
cvgeometry.cpp 355 cvRQDecomp3x3( const CvMat *matrixM, CvMat *matrixR, CvMat *matrixQ,
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 );
  /external/eigen/Eigen/src/QR/
FullPivHouseholderQR.h 143 MatrixQReturnType matrixQ(void) const;
514 * \brief Expression type for return value of FullPivHouseholderQR::matrixQ()
575 inline typename FullPivHouseholderQR<MatrixType>::MatrixQReturnType FullPivHouseholderQR<MatrixType>::matrixQ() const
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 92 if(svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
137 if(svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace);
    [all...]
  /external/opencv/cv/include/
cv.h     [all...]

Completed in 972 milliseconds