Searched refs:adjoint (Results 76 - 100 of 116) sorted by relevance

12345

/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DDGMRES.h346 m_H.col(it).applyOnTheLeft(i-1,i,gr[i-1].adjoint());
351 m_H.col(it).applyOnTheLeft(it,it+1,gr[it].adjoint());
352 g.applyOnTheLeft(it,it+1, gr[it].adjoint());
H A DIncompleteCholesky.h101 x = m_L.adjoint().template triangularView<Upper>().solve(x);
/external/eigen/Eigen/src/Householder/
H A DHouseholderSequence.h46 * A.applyOnTheRight(H.adjoint()); // A = A * H^*
47 * A.applyOnTheLeft(H.adjoint()); // A = H^* * A
50 * In addition to the adjoint, you can also apply the inverse (=adjoint), the transpose, and the conjugate operators.
218 ConjugateReturnType adjoint() const function in class:Eigen::HouseholderSequence
223 /** \brief Inverse of the Householder sequence (equals the adjoint). */
224 ConjugateReturnType inverse() const { return adjoint(); }
372 /* Necessary for .adjoint() and .conjugate() */
/external/eigen/blas/
H A Dlevel3_impl.h611 += alpha *matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).adjoint()
612 + numext::conj(alpha)*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).adjoint();
616 += alpha*matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).adjoint()
617 + numext::conj(alpha)*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).adjoint();
623 += alpha*matrix(a, *k, *n, *lda).adjoint()*matrix(b, *k, *n, *ldb)
624 + numext::conj(alpha)*matrix(b, *k, *n, *ldb).adjoint()*matrix(a, *k, *n, *lda);
627 += alpha*matrix(a, *k, *n, *lda).adjoint()*matrix(b, *k, *n, *ldb)
628 + numext::conj(alpha)*matrix(b, *k, *n, *ldb).adjoint()*matrix(a, *k, *n, *lda);
/external/eigen/test/
H A Dsparse_solver.h144 A = M * M.adjoint();
145 dA = dM * dM.adjoint();
H A Dlu.cpp87 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image);
H A Dqr.cpp69 m1 += a * a.adjoint();
H A Dqr_colpivoting.cpp87 m1 += a * a.adjoint();
H A Dqr_fullpivoting.cpp67 m1 += a * a.adjoint();
H A Dgeo_transformations.cpp106 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
367 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
371 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
/external/eigen/bench/
H A DbenchEigenSolver.cpp46 SquareMatrixType covMat = a * a.adjoint();
H A Deig33.cpp179 A = A.adjoint() * A;
/external/eigen/test/eigen2/
H A Deigen2_sparse_product.cpp71 // test self adjoint products
95 VERIFY_IS_APPROX(refS.adjoint(), refS);
H A Deigen2_geometry.cpp73 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
347 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
351 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
H A Deigen2_geometry_with_eigen2_prefix.cpp75 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
349 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
353 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
H A DLMonestep.h70 m_wa4 = qrfac.matrixQ().adjoint() * m_fvec;
/external/eigen/Eigen/src/Geometry/
H A DTransform.h1023 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1
1026 if(scaling) scaling->lazyAssign(svd.matrixV() * sv.asDiagonal() * svd.matrixV().adjoint());
1031 rotation->lazyAssign(m * svd.matrixV().adjoint());
1052 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1
1055 if(scaling) scaling->lazyAssign(svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint());
1060 rotation->lazyAssign(m * svd.matrixV().adjoint());
/external/eigen/Eigen/src/Eigenvalues/
H A DSelfAdjointEigenSolver.h36 * A matrix \f$ A \f$ is selfadjoint if it equals its adjoint. For real
278 return m_eivec * m_eivalues.cwiseSqrt().asDiagonal() * m_eivec.adjoint();
303 return m_eivec * m_eivalues.cwiseInverse().cwiseSqrt().asDiagonal() * m_eivec.adjoint();
/external/eigen/Eigen/src/SparseCholesky/
H A DSimplicialCholesky.h261 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
275 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
/external/eigen/unsupported/Eigen/src/Eigenvalues/
H A DArpackSelfAdjointEigenSolver.h81 * \param[in] A Self-adjoint matrix whose eigenvalues / eigenvectors will
84 * \param[in] B Self-adjoint matrix for the generalized eigenvalue problem.
116 * \param[in] A Self-adjoint matrix whose eigenvalues / eigenvectors will
273 return m_eivec * m_eivalues.cwiseSqrt().asDiagonal() * m_eivec.adjoint();
298 return m_eivec * m_eivalues.cwiseInverse().cwiseSqrt().asDiagonal() * m_eivec.adjoint();
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixFunction.h212 result = m_U * (m_fT.template triangularView<Upper>() * m_U.adjoint());
355 m_T.applyOnTheLeft(index, index+1, rotation.adjoint());
H A DMatrixPower.h432 { res.noalias() = U * (T.template triangularView<Upper>() * U.adjoint()); }
440 { res.noalias() = (U * (T.template triangularView<Upper>() * U.adjoint())).real(); }
H A DMatrixSquareRoot.h362 result = U * sqrtT * U.adjoint();
395 result = U * (sqrtT.template triangularView<Upper>() * U.adjoint());
/external/eigen/Eigen/src/QR/
H A DHouseholderQR.h300 apply_block_householder_on_the_left(A21_22,A11_21,hCoeffsSegment.adjoint());
/external/eigen/Eigen/src/SPQRSupport/
H A DSuiteSparseQRSupport.h273 SPQRMatrixQTransposeReturnType<SPQRType> adjoint() const function in struct:Eigen::SPQRMatrixQReturnType

Completed in 207 milliseconds

12345