/external/eigen/test/eigen2/ |
D | eigen2_qr.cpp | 27 VERIFY_IS_APPROX(a, qrOfA.matrixQ() * qrOfA.matrixR()); in qr() 28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR()); in qr() 35 VERIFY_IS_APPROX(b, tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint()); in qr() 39 VERIFY_IS_APPROX(b, hess.matrixQ() * hess.matrixH() * hess.matrixQ().adjoint()); in qr() 43 VERIFY_IS_APPROX(b, hess.matrixQ() * hess.matrixH() * hess.matrixQ().adjoint()); in qr()
|
D | eigen2_hyperplane.cpp | 52 MatrixType rot = MatrixType::Random(dim,dim).qr().matrixQ(); in hyperplane()
|
/external/eigen/doc/snippets/ |
D | RealQZ_compute.cpp | 9 cout << "Q:\n" << qz.matrixQ() << "\n" << "Z:\n" << qz.matrixZ() << "\n"; 13 << "\n|A-QSZ|: " << (A-qz.matrixQ()*qz.matrixS()*qz.matrixZ()).norm() 14 << ", |B-QTZ|: " << (B-qz.matrixQ()*qz.matrixT()*qz.matrixZ()).norm() 15 << "\n|QQ* - I|: " << (qz.matrixQ()*qz.matrixQ().adjoint() - MatrixXf::Identity(4,4)).norm()
|
D | HessenbergDecomposition_matrixH.cpp | 6 MatrixXf Q = hessOfA.matrixQ();
|
D | Tridiagonalization_Tridiagonalization_MatrixType.cpp | 5 MatrixXd Q = triOfA.matrixQ();
|
/external/eigen/test/ |
D | hessenberg.cpp | 22 MatrixType Q = hess.matrixQ(); in hessenberg() 38 MatrixType cs1Q = cs1.matrixQ(); in hessenberg() 39 MatrixType cs2Q = cs2.matrixQ(); in hessenberg() 45 VERIFY_RAISES_ASSERT( hessUninitialized.matrixQ() ); in hessenberg()
|
D | real_qz.cpp | 59 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixS()*qz.matrixZ(), A); in real_qz() 60 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixT()*qz.matrixZ(), B); in real_qz() 61 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixQ().adjoint(), MatrixType::Identity(dim,dim)); in real_qz()
|
D | qr_fullpivoting.cpp | 34 MatrixQType q = qr.matrixQ(); in qr() 40 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse(); in qr() 83 m3 = qr.matrixQ(); // get a unitary in qr_invertible() 97 VERIFY_RAISES_ASSERT(qr.matrixQ()) in qr_verify_assert()
|
D | eigensolver_selfadjoint.cpp | 115 …template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(trid… in selfadjointeigensolver()
|
D | sparseqr.cpp | 86 Q = solver.matrixQ(); in test_sparseqr_scalar()
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | ComplexSchur.h | 209 …mputeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU=t… 338 …:computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) 342 m_matU = matrixQ; 357 if(computeU) _this.m_matU = _this.m_hess.matrixQ(); 374 MatrixType Q = _this.m_hess.matrixQ();
|
D | RealSchur.h | 188 …RealSchur& computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bo… 257 computeFromHessenberg(m_hess.matrixH(), m_hess.matrixQ(), computeU); in compute() 263 …computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) in computeFromHessenberg() argument 267 m_matU = matrixQ; in computeFromHessenberg()
|
D | SelfAdjointEigenSolver.h | 385 …l_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n); 736 …al_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n) 785 if (matrixQ) 788 Map<Matrix<Scalar,Dynamic,Dynamic,StorageOrder> > q(matrixQ,n,n);
|
D | HessenbergDecomposition.h | 232 HouseholderSequenceType matrixQ() const
|
D | Tridiagonalization.h | 238 HouseholderSequenceType matrixQ() const
|
/external/opencv/cv/src/ |
D | cvgeometry.cpp | 355 cvRQDecomp3x3( const CvMat *matrixM, CvMat *matrixR, CvMat *matrixQ, in cvRQDecomp3x3() argument 369 CV_ASSERT( CV_IS_MAT(matrixM) && CV_IS_MAT(matrixR) && CV_IS_MAT(matrixQ) && in cvRQDecomp3x3() 371 CV_ARE_SIZES_EQ(matrixM, matrixR) && CV_ARE_SIZES_EQ(matrixM, matrixQ)); in cvRQDecomp3x3() 513 cvConvert( &Q, matrixQ ); in cvRQDecomp3x3()
|
/external/eigen/Eigen/src/Eigen2Support/ |
D | QR.h | 36 MatrixType matrixQ(void) const { in matrixQ() function
|
/external/eigen/Eigen/src/SPQRSupport/ |
D | SuiteSparseQRSupport.h | 161 y = matrixQ().transpose() * b; 193 SPQRMatrixQReturnType<SPQR> matrixQ() const
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
D | DGMRES.h | 439 DenseMatrix matrixQ(it,it); 440 matrixQ.setIdentity(); 441 schurofH.computeFromHessenberg(m_Hes.topLeftCorner(it,it), matrixQ, computeU);
|
/external/eigen/Eigen/src/SparseQR/ |
D | SparseQR.h | 146 SparseQRMatrixQReturnType<SparseQR> matrixQ() const 174 y = this->matrixQ().transpose() * B; 686 dest.derived() = m_qr.matrixQ() * Dest::Identity(m_qr.rows(), m_qr.rows());
|
/external/eigen/Eigen/src/QR/ |
D | FullPivHouseholderQR.h | 157 MatrixQReturnType matrixQ(void) const; 603 …llPivHouseholderQR<MatrixType>::MatrixQReturnType FullPivHouseholderQR<MatrixType>::matrixQ() const
|
D | ColPivHouseholderQR.h | 149 HouseholderSequenceType matrixQ(void) const in matrixQ() function
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
D | LMonestep.h | 70 m_wa4 = qrfac.matrixQ().adjoint() * m_fvec; in minimizeOneStep()
|
/external/opencv3/modules/calib3d/include/opencv2/calib3d/ |
D | calib3d_c.h | 153 CVAPI(void) cvRQDecomp3x3( const CvMat *matrixM, CvMat *matrixR, CvMat *matrixQ,
|
/external/eigen/unsupported/Eigen/src/SVD/ |
D | JacobiSVD.h | 93 if(svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace); in run() 140 if(svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace); in run()
|