| /external/eigen/Eigen/src/Jacobi/ |
| Jacobi.h | 27 * applying its adjoint on the left: \f$ v = J^* v \f$ that translates to the following Eigen code:
29 * v.applyOnTheLeft(J.adjoint());
61 /** Returns the adjoint transformation */
62 JacobiRotation adjoint() const { using numext::conj; return JacobiRotation(conj(m_c), -m_s); } function in class:Eigen::JacobiRotation
|
| /external/eigen/Eigen/src/Core/ |
| SolverBase.h | 33 * x = dec.adjoint().solve(b); // solve A' * x = b
36 * \warning Currently, any other usage of transpose() and adjoint() are not supported and will produce compilation errors.
88 * \sa adjoint(), solve()
95 /** \internal the return type of adjoint() */
100 /** \returns an expression of the adjoint of the factored matrix
102 * A typical usage is to solve for the adjoint problem A' x = b:
103 * \code x = dec.adjoint().solve(b); \endcode
109 inline AdjointReturnType adjoint() const function in class:Eigen::SolverBase
|
| SelfAdjointView.h | 145 * a adjoint expression without any overhead. Only the meaningful triangular
160 * call this function with u.adjoint().
199 /** \sa MatrixBase::adjoint() const */
201 inline const AdjointReturnType adjoint() const function in class:Eigen::SelfAdjointView
202 { return AdjointReturnType(m_matrix.adjoint()); }
331 /** \returns an expression of a symmetric/self-adjoint view extracted from the upper or lower triangular part of the current matrix
|
| Transpose.h | 47 * It is the return type of MatrixBase::transpose() and MatrixBase::adjoint()
50 * \sa MatrixBase::transpose(), MatrixBase::adjoint()
169 * \sa transposeInPlace(), adjoint() */
181 * \sa transposeInPlace(), adjoint() */
189 /** \returns an expression of the adjoint (i.e. conjugate transpose) of *this.
194 * \warning If you want to replace a matrix by its own adjoint, do \b NOT do this:
196 * m = m.adjoint(); // bug!!! caused by aliasing effect
204 * m = m.adjoint().eval();
210 MatrixBase<Derived>::adjoint() const function in class:Eigen::MatrixBase
282 * \sa transpose(), adjoint(), adjointInPlace() *
[all...] |
| TriangularMatrix.h | 246 /** \sa MatrixBase::adjoint() const */
248 inline const AdjointReturnType adjoint() const function in class:Eigen::TriangularView
249 { return AdjointReturnType(m_matrix.adjoint()); }
[all...] |
| /external/eigen/test/ |
| adjoint.cpp | 22 // check compatibility of dot and adjoint
23 VERIFY(test_isApproxWithRef(v1.dot(square * v2), (square.adjoint() * v1).dot(v2), 0));
57 // check compatibility of dot and adjoint
58 ref = NumTraits<Scalar>::IsInteger ? 0 : (std::max)((std::max)(v1.norm(),v2.norm()),(std::max)((square * v2).norm(),(square.adjoint() * v1).norm()));
59 VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref, test_precision<Scalar>()));
67 template<typename MatrixType> void adjoint(const MatrixType& m) function
95 // check basic compatibility of adjoint, transpose, conjugate
96 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1);
97 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1);
100 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1)
[all...] |
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 46 * 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.
223 /** \brief Adjoint (conjugate transpose) of the Householder sequence. */
224 ConjugateReturnType adjoint() const function in class:Eigen::HouseholderSequence
229 /** \brief Inverse of the Householder sequence (equals the adjoint). */
230 ConjugateReturnType inverse() const { return adjoint(); }
401 /* Necessary for .adjoint() and .conjugate() */
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 238 /** \returns the adjoint of \c *this, that is, a const reference to the decomposition itself as the underlying matrix is self-adjoint.
241 * \code x = decomposition.adjoint().solve(b) \endcode
243 const LDLT& adjoint() const { return *this; }; function in class:Eigen::LDLT
351 temp.head(k) = mat.diagonal().real().head(k).asDiagonal() * A10.adjoint();
473 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); }
480 static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); }
|
| LLT.h | 188 /** \returns the adjoint of \c *this, that is, a const reference to the decomposition itself as the underlying matrix is self-adjoint.
191 * \code x = decomposition.adjoint().solve(b) \endcode
193 const LLT& adjoint() const { return *this; }; function in class:Eigen::LLT
321 if (k>0 && rs>0) A21.noalias() -= A20 * A10.adjoint();
353 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21);
395 static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); }
404 static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); }
507 return matrixL() * matrixL().adjoint().toDenseMatrix();
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| SuiteSparseQRSupport.h | 289 SPQRMatrixQTransposeReturnType<SPQRType> adjoint() const function in struct:Eigen::SPQRMatrixQReturnType
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 105 /** \internal the return type of MatrixBase::adjoint() */
351 const AdjointReturnType adjoint() const { return AdjointReturnType(transpose()); } function in class:Eigen::SparseMatrixBase
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 671 SparseQRMatrixQTransposeReturnType<SparseQRType> adjoint() const function in struct:Eigen::SparseQRMatrixQReturnType
|
