/external/eigen/test/ |
H A D | sparse_product.cpp | 138 VERIFY_IS_APPROX(cv1=m3t.adjoint()*cv0, dcv1=refMat3t.adjoint()*dcv0); 175 // test self adjoint products 189 refLo = refUp.adjoint(); 190 mLo = mUp.adjoint(); 200 VERIFY_IS_APPROX(refS.adjoint(), refS); 201 VERIFY_IS_APPROX(mS.adjoint(), mS);
|
H A D | determinant.cpp | 42 VERIFY_IS_APPROX(numext::conj(m2.determinant()), m2.adjoint().determinant());
|
H A D | sparseqr.cpp | 87 QtQ = Q * Q.adjoint();
|
H A D | triangular.cpp | 73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps)); 83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), largerEps));
|
H A D | product.h | 136 VERIFY_IS_APPROX(res.col(r).noalias() = square.adjoint() * square.col(r), (square.adjoint() * square.col(r)).eval());
|
H A D | product_trsolve.cpp | 47 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Lower>(), cmRhs); 51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs);
|
H A D | sparse_solvers.cpp | 19 refMat = refMat * refMat.adjoint(); 23 refMat += aux * aux.adjoint();
|
H A D | eigensolver_complex.cpp | 46 MatrixType symmA = a.adjoint() * a;
|
H A D | schur_complex.cpp | 31 VERIFY_IS_APPROX(A.template cast<ComplexScalar>(), U * T * U.adjoint());
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | GMRES.h | 133 v.applyOnTheLeft(i, i + 1, G[i].adjoint()); 142 v.applyOnTheLeft(k - 1, k, G[k - 1].adjoint()); 143 w.applyOnTheLeft(k - 1, k, G[k - 1].adjoint());
|
/external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
H A D | mat2-spec.js | 96 describe("adjoint", function() { 98 beforeEach(function() { result = mat2.adjoint(out, matA); }); 106 beforeEach(function() { result = mat2.adjoint(matA, matA); });
|
H A D | mat4-spec.js | 147 describe("adjoint", function() { 149 beforeEach(function() { result = mat4.adjoint(out, matA); }); 171 beforeEach(function() { result = mat4.adjoint(matA, matA); });
|
/external/eigen/Eigen/src/Householder/ |
H A D | Householder.h | 125 tmp.noalias() = essential.adjoint() * bottom;
|
/external/eigen/Eigen/src/SVD/ |
H A D | JacobiSVD_MKL.h | 74 if (computeV()) m_matrixV = localV.adjoint(); \
|
H A D | JacobiSVD.h | 137 m_adjoint = matrix.adjoint(); 139 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 230 m_adjoint = matrix.adjoint(); 233 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 329 m_adjoint = matrix.adjoint(); 332 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 397 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); 938 tmp.noalias() = dec().matrixU().leftCols(rank).adjoint() * rhs();
|
/external/eigen/unsupported/Eigen/src/SVD/ |
H A D | JacobiSVD.h | 137 m_adjoint = matrix.adjoint(); 139 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 230 m_adjoint = matrix.adjoint(); 233 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 329 m_adjoint = matrix.adjoint(); 332 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); 392 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); 760 * dec().matrixU().leftCols(diagSize).adjoint()
|
/external/eigen/Eigen/src/Cholesky/ |
H A D | LLT.h | 285 if (k>0 && rs>0) A21.noalias() -= A20 * A10.adjoint(); 318 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21); 360 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); } 369 static inline MatrixL getL(const MatrixType& m) { return m.adjoint(); } 465 return matrixL() * matrixL().adjoint().toDenseMatrix();
|
H A D | LDLT.h | 314 temp.head(k) = mat.diagonal().real().head(k).asDiagonal() * A10.adjoint(); 419 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); } 426 static inline MatrixL getL(const MatrixType& m) { return m.adjoint(); }
|
/external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/ |
H A D | mat2.js | 143 mat2.adjoint = function(out, a) {
|
/external/eigen/bench/ |
H A D | benchCholesky.cpp | 47 SquareMatrixType covMat = a * a.adjoint();
|
/external/eigen/test/eigen2/ |
H A D | eigen2_lu.cpp | 92 m1 += a * a.adjoint();
|
/external/eigen/Eigen/src/Core/ |
H A D | SelfAdjointView.h | 104 /** Efficient self-adjoint matrix times vector/matrix product */ 114 /** Efficient vector/matrix times self-adjoint matrix product */ 129 * a adjoint expression without any overhead. Only the meaningful triangular 143 * call this function with u.adjoint(). 173 m_matrix.const_cast_derived().template triangularView<OtherPart>() = other.adjoint(); 183 m_matrix.const_cast_derived().template triangularView<OtherPart>() = other.toDenseMatrix().adjoint();
|
H A D | Transpose.h | 24 * It is the return type of MatrixBase::transpose() and MatrixBase::adjoint() 27 * \sa MatrixBase::transpose(), MatrixBase::adjoint() 196 * \sa transposeInPlace(), adjoint() */ 208 * \sa transposeInPlace(), adjoint() */ 216 /** \returns an expression of the adjoint (i.e. conjugate transpose) of *this. 221 * \warning If you want to replace a matrix by its own adjoint, do \b NOT do this: 223 * m = m.adjoint(); // bug!!! caused by aliasing effect 231 * m = m.adjoint().eval(); 237 MatrixBase<Derived>::adjoint() const function in class:Eigen::MatrixBase 290 * \sa transpose(), adjoint(), adjointInPlac [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexSchur.h | 431 m_matT.rightCols(m_matT.cols()-il).applyOnTheLeft(il, il+1, rot.adjoint()); 439 m_matT.rightCols(m_matT.cols()-i).applyOnTheLeft(i, i+1, rot.adjoint());
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | Transform.h | 622 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 627 scaling->noalias() = svd.matrixV() * sv.asDiagonal() * svd.matrixV().adjoint(); 633 rotation->noalias() = m * svd.matrixV().adjoint(); 653 Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 658 scaling->noalias() = svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint(); 664 rotation->noalias() = m * svd.matrixV().adjoint();
|