/external/eigen/test/ |
D | product_extra.cpp | 52 …VERIFY_IS_APPROX( m1.adjoint() * (s1*m2).conjugate(), (m1.adjoint()).eval() * ((s1*m2).conjugate()… in product_extra() 57 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2), in product_extra() 58 (-m1.conjugate()*s2).eval() * (s1 * vc2).eval()); in product_extra() 59 VERIFY_IS_APPROX((-m1 * s2) * (s1 * vc2.conjugate()), in product_extra() 60 (-m1*s2).eval() * (s1 * vc2.conjugate()).eval()); in product_extra() 61 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2.conjugate()), in product_extra() 62 (-m1.conjugate()*s2).eval() * (s1 * vc2.conjugate()).eval()); in product_extra() 78 VERIFY_IS_APPROX((s1 * v1) * (-m1.conjugate() * s2), in product_extra() 79 (s1 * v1).eval() * (-m1.conjugate()*s2).eval()); in product_extra() 80 VERIFY_IS_APPROX((s1 * v1.conjugate()) * (-m1 * s2), in product_extra() [all …]
|
D | product_trsolve.cpp | 46 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Lower>(), cmRhs); in trsolve() 50 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Upper>(), rmRhs); in trsolve() 53 VERIFY_TRSM(cmLhs.conjugate().template triangularView<UnitLower>(), cmRhs); in trsolve() 57 VERIFY_TRSM(rmLhs.conjugate().template triangularView<UnitUpper>(), rmRhs); in trsolve() 60 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Lower>(), cmRhs); in trsolve() 63 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Upper>(), rmRhs); in trsolve() 65 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<UnitLower>(), cmRhs); in trsolve() 69 VERIFY_TRSM_ONTHERIGHT(rmLhs.conjugate().template triangularView<UnitUpper>(), rmRhs); in trsolve()
|
D | product_trmv.cpp | 44 …VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lowe… in trmv() 46 …VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Up… in trmv() 62 …ERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Up… in trmv()
|
D | product_trmm.cpp | 48 …)).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.… in trmm() 49 …spose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate()); in trmm() 51 …t()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr.conjugate() * (s2*ge_left.… in trmm() 52 …adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate()); in trmm() 55 …VERIFY_IS_APPROX( (ge_xs_save + s1*triTr.conjugate() * (s2*ge_left.adjoint())).eval(), ge_xs.noali… in trmm() 57 …VERIFY_IS_APPROX( ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noal… in trmm() 59 … triangularView<Mode>() * ge_left.adjoint(), internal::conj(s1) * triTr.conjugate() * ge_left.adjo… in trmm()
|
D | product_syrk.cpp | 68 …VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expre… in syrk() 69 …((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Low… in syrk() 72 …VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c).conjugate(),s1)._expre… in syrk() 73 …((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Upp… in syrk()
|
D | cholesky.cpp | 113 …VERIFY_IS_APPROX(MatrixType(chollo.matrixL().transpose().conjugate()), MatrixType(chollo.matrixU()… in cholesky() 114 …VERIFY_IS_APPROX(MatrixType(chollo.matrixU().transpose().conjugate()), MatrixType(chollo.matrixL()… in cholesky() 115 …VERIFY_IS_APPROX(MatrixType(cholup.matrixL().transpose().conjugate()), MatrixType(cholup.matrixU()… in cholesky() 116 …VERIFY_IS_APPROX(MatrixType(cholup.matrixU().transpose().conjugate()), MatrixType(cholup.matrixL()… in cholesky() 145 …VERIFY_IS_APPROX(MatrixType(ldltlo.matrixL().transpose().conjugate()), MatrixType(ldltlo.matrixU()… in cholesky() 146 …VERIFY_IS_APPROX(MatrixType(ldltlo.matrixU().transpose().conjugate()), MatrixType(ldltlo.matrixL()… in cholesky() 147 …VERIFY_IS_APPROX(MatrixType(ldltup.matrixL().transpose().conjugate()), MatrixType(ldltup.matrixU()… in cholesky() 148 …VERIFY_IS_APPROX(MatrixType(ldltup.matrixU().transpose().conjugate()), MatrixType(ldltup.matrixL()… in cholesky()
|
D | adjoint.cpp | 41 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint() 42 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint() 76 VERIFY_IS_APPROX(m1.conjugate()(r,c), internal::conj(m1(r,c))); in adjoint() 98 VERIFY_IS_APPROX(m3,m1.conjugate()); in adjoint() 126 VERIFY_RAISES_ASSERT(a = a.conjugate().transpose()); in test_adjoint()
|
D | sparse_solvers.cpp | 60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers() 61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers() 66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers() 67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
|
D | triangular.cpp | 63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), in triangular_square() 64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); in triangular_square() 79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square() 89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
|
D | product_symm.cpp | 68 …RIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(), in symm() 69 rhs13 = (s1*m1.adjoint()) * (s2*rhs3).conjugate()); in symm() 73 …rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate()), in symm() 74 rhs13 += (s1*m1.adjoint()) * (s2*rhs3).conjugate()); in symm()
|
/external/eigen/Eigen/src/Geometry/ |
D | OrthoMethods.h | 111 …w(0) = (_expression().row(1) * other.coeff(2) - _expression().row(2) * other.coeff(1)).conjugate(); in cross() 112 …w(1) = (_expression().row(2) * other.coeff(0) - _expression().row(0) * other.coeff(2)).conjugate(); in cross() 113 …w(2) = (_expression().row(0) * other.coeff(1) - _expression().row(1) * other.coeff(0)).conjugate(); in cross() 118 …l(0) = (_expression().col(1) * other.coeff(2) - _expression().col(2) * other.coeff(1)).conjugate(); in cross() 119 …l(1) = (_expression().col(2) * other.coeff(0) - _expression().col(0) * other.coeff(2)).conjugate(); in cross() 120 …l(2) = (_expression().col(0) * other.coeff(1) - _expression().col(1) * other.coeff(0)).conjugate(); in cross()
|
/external/eigen/test/eigen2/ |
D | eigen2_adjoint.cpp | 44 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint() 45 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint() 69 VERIFY_IS_APPROX(m1.conjugate()(r,c), ei_conj(m1(r,c))); in adjoint()
|
D | eigen2_sparse_product.cpp | 85 refLo = refUp.transpose().conjugate(); in sparse_product() 86 mLo = mUp.transpose().conjugate(); in sparse_product() 96 VERIFY_IS_APPROX(mS.transpose().conjugate(), mS); in sparse_product()
|
/external/eigen/Eigen/src/Core/products/ |
D | GeneralMatrixMatrix_MKL.h | 94 a_tmp = lhs.conjugate(); \ 101 b_tmp = rhs.conjugate(); \
|
D | TriangularMatrixVector_MKL.h | 102 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ 133 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ 187 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ 218 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \
|
D | SelfadjointMatrixMatrix_MKL.h | 133 a_tmp = lhs.conjugate(); \ 144 b_tmp = rhs.conjugate(); \ 258 a_tmp = rhs.conjugate(); \ 269 b_tmp = lhs.conjugate(); \
|
D | TriangularMatrixMatrix_MKL.h | 153 if (ConjugateRhs) b_tmp = rhs.conjugate(); else b_tmp = rhs; \ 165 if (conjA) a_tmp = lhs.conjugate(); else a_tmp = lhs; \ 267 if (ConjugateLhs) b_tmp = lhs.conjugate(); else b_tmp = lhs; \ 279 if (conjA) a_tmp = rhs.conjugate(); else a_tmp = rhs; \
|
D | TriangularSolverMatrix_MKL.h | 76 a_tmp = tri.conjugate(); \ 131 a_tmp = tri.conjugate(); \
|
/external/eigen/doc/snippets/ |
D | tut_arithmetic_transpose_conjugate.cpp | 7 cout << "Here is the conjugate of a\n" << a.conjugate() << endl;
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | HessenbergDecomposition.h | 235 return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate()) 316 ….applyHouseholderOnTheRight(matA.col(i).tail(remainingSize-1).conjugate(), internal::conj(h), &tem…
|
D | Tridiagonalization.h | 241 return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate()) 451 mat = HouseholderSequenceType(mat, hCoeffs.conjugate()) 541 result.template diagonal<1>() = m_matrix.template diagonal<-1>().conjugate();
|
/external/eigen/doc/ |
D | C02_TutorialMatrixArithmetic.dox | 94 …conjugate \f$ \bar{a} \f$, and adjoint (i.e., conjugate transpose) \f$ a^* \f$ of a matrix or vect… 105 For real matrices, \c conjugate() is a no-operation, and so \c adjoint() is equivalent to \c transp… 175 When using complex numbers, Eigen's dot product is conjugate-linear in the first variable and linea…
|
D | I02_HiPerformance.dox | 30 alpha is a scalar value, and op1, op2 can be transpose, adjoint, conjugate, or the identity. 37 \code m1.noalias() -= s4 * (s1 * m2.adjoint() * (-(s3*m3).conjugate()*s2)) \endcode 39 \code m1.noalias() += (s1*s2*conj(s3)*s4) * m2.adjoint() * m3.conjugate() \endcode
|
/external/eigen/demos/opengl/ |
D | camera.cpp | 159 qa = qa.conjugate(); in rotateAroundTarget() 197 Quaternionf q = orientation().conjugate(); in updateViewMatrix()
|
/external/eigen/Eigen/src/Householder/ |
D | HouseholderSequence.h | 209 ConjugateReturnType conjugate() const 211 return ConjugateReturnType(m_vectors, m_coeffs.conjugate()) 220 return conjugate().setTrans(!m_trans);
|