/external/eigen/test/ |
D | product_syrk.cpp | 39 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk() 41 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk() 42 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk() 47 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk() 49 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk() 50 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk() 54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 55 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 57 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk() 58 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() [all …]
|
D | product_extra.cpp | 41 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval()); in product_extra() 42 …VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.ad… in product_extra() 43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2); in product_extra() 44 …VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2… in product_extra() 45 …VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (numext::conj(s1) * m1.adjoint(… in product_extra() 46 …VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() *… in product_extra() 47 …VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval(… in product_extra() 48 …VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m2.adjoint(), (-m1*s2).eval() * (s1*m2.adjoin… in product_extra() 51 …VERIFY_IS_APPROX( m1.adjoint() * (s1*m2).conjugate(), (m1.adjoint()).eval() * ((s1*m2).conjugate()… in product_extra() 63 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2), in product_extra() [all …]
|
D | product_notemporary.cpp | 60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary() 61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary() 65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); in product_notemporary() 66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); in product_notemporary() 67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); in product_notemporary() 68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); in product_notemporary() 71 …lock(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0); in product_notemporary() 78 …VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template triangularView<Upper>() * (m… in product_notemporary() 79 …FY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * m2… in product_notemporary() 81 VERIFY_EVALUATION_COUNT( m3.template triangularView<Upper>() = (m1 * m2.adjoint()), 0); in product_notemporary() [all …]
|
D | adjoint.cpp | 23 VERIFY(test_isApproxWithRef(v1.dot(square * v2), (square.adjoint() * v1).dot(v2), 0)); in run() 47 …)((std::max)(v1.norm(),v2.norm()),(std::max)((square * v2).norm(),(square.adjoint() * v1).norm())); in run() 48 …VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref… in run() 56 template<typename MatrixType> void adjoint(const MatrixType& m) in adjoint() function 84 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint() 85 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint() 88 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1); in adjoint() 89 VERIFY_IS_APPROX((s1 * m1).adjoint(), numext::conj(s1) * m1.adjoint()); in adjoint() 103 VERIFY_IS_APPROX(m1.adjoint()(c,r), numext::conj(m1(r,c))); in adjoint() 115 VERIFY_IS_APPROX(m3,m1.adjoint()); in adjoint() [all …]
|
D | product_selfadjoint.cpp | 38 m1 = (m1.adjoint() + m1).eval(); in product_selfadjoint() 43 …VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().… in product_selfadjoint() 47 …VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+numext::conj(s3)*(s2*v2)*(-v1).adjoint())).… in product_selfadjoint() 50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1); in product_selfadjoint() 51 …OX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + numext::conj(s1)*(r2.adjoint()*s3… in product_selfadjoint() 58 …ws-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adj… in product_selfadjoint()
|
D | nomalloc.cpp | 58 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc() 59 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc() 60 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc() 63 m2.row(0).noalias() -= m1.row(0) * m1.adjoint(); in nomalloc() 64 m2.row(0).noalias() -= m1.col(0).adjoint() * m1; in nomalloc() 65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint(); in nomalloc() 69 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0); in nomalloc() 70 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc() 71 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc() 74 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>(); in nomalloc() [all …]
|
D | product_trmm.cpp | 46 …VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_le… in trmm() 47 …VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<M… in trmm() 49 ….noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr… in trmm() 50 …_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), … in trmm() 53 …gate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangular… in trmm() 56 …ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noalias() -= (ge_right… in trmm() 58 … ge_xs = (s1*mat).adjoint().template triangularView<Mode>() * ge_left.adjoint(), numext::conj(s1) … in trmm()
|
D | product_mmtr.cpp | 38 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint()); in mmtr() 39 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint())); in mmtr() 40 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint()); in mmtr() 41 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint())); in mmtr() 43 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint()); in mmtr() 45 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint()); in mmtr() 46 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint())); in mmtr() 48 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint()); in mmtr() 50 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint()); in mmtr() 51 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint())); in mmtr()
|
D | mixingtypes.cpp | 111 VERIFY_IS_APPROX(sf*vcf.adjoint()*mf, sf*vcf.adjoint()*mf.template cast<CF>().eval()); in mixingtypes() 112 VERIFY_IS_APPROX(scf*vcf.adjoint()*mf, scf*vcf.adjoint()*mf.template cast<CF>().eval()); in mixingtypes() 113 VERIFY_IS_APPROX(sf*vf.adjoint()*mcf, sf*vf.adjoint().template cast<CF>().eval()*mcf); in mixingtypes() 114 VERIFY_IS_APPROX(scf*vf.adjoint()*mcf, scf*vf.adjoint().template cast<CF>().eval()*mcf); in mixingtypes() 121 VERIFY_IS_APPROX(sd*vcd.adjoint()*md, sd*vcd.adjoint()*md.template cast<CD>().eval()); in mixingtypes() 122 VERIFY_IS_APPROX(scd*vcd.adjoint()*md, scd*vcd.adjoint()*md.template cast<CD>().eval()); in mixingtypes() 123 VERIFY_IS_APPROX(sd*vd.adjoint()*mcd, sd*vd.adjoint().template cast<CD>().eval()*mcd); in mixingtypes() 124 VERIFY_IS_APPROX(scd*vd.adjoint()*mcd, scd*vd.adjoint().template cast<CD>().eval()*mcd); in mixingtypes()
|
D | product_symm.cpp | 27 m1 = (m1+m1.adjoint()).eval(); in symm() 49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm() 50 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm() 53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm() 54 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm() 57 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm() 58 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm() 66 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate… in symm() 67 rhs13 = (s1*m1.adjoint()) * (s2*rhs3).conjugate()); in symm() 71 …VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*r… in symm() [all …]
|
D | product_trmv.cpp | 60 …VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, lar… in trmv() 62 …VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::U… in trmv() 68 …VERIFY((v1.adjoint() * m3).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Lower>(), lar… in trmv() 69 …VERIFY((v1.adjoint() * m3.adjoint()).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Low… in trmv()
|
D | upperbidiagonalization.cpp | 26 MatrixType c = ubd.householderU() * b * ubd.householderV().adjoint(); in upperbidiag() 28 TransposeMatrixType d = ubd.householderV() * b.adjoint() * ubd.householderU().adjoint(); in upperbidiag() 29 VERIFY_IS_APPROX(a.adjoint(),d); in upperbidiag()
|
D | eigensolver_generalized_real.cpp | 30 MatrixType spdA = a.adjoint() * a + a1.adjoint() * a1; in generalized_eigensolver_real() 31 MatrixType spdB = b.adjoint() * b + b1.adjoint() * b1; in generalized_eigensolver_real()
|
D | eigensolver_selfadjoint.cpp | 31 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1; in selfadjointeigensolver() 50 MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1; in selfadjointeigensolver() 115 …Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint()); in selfadjointeigensolver()
|
/external/eigen/test/eigen2/ |
D | eigen2_adjoint.cpp | 12 template<typename MatrixType> void adjoint(const MatrixType& m) in adjoint() function 42 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint() 43 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint() 46 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1); in adjoint() 47 VERIFY_IS_APPROX((s1 * m1).adjoint(), ei_conj(s1) * m1.adjoint()); in adjoint() 62 …VERIFY(ei_isApprox(v1.eigen2_dot(square * v2), (square.adjoint() * v1).eigen2_dot(v2), largerEps)); in adjoint() 68 VERIFY_IS_APPROX(m1.adjoint()(c,r), ei_conj(m1(r,c))); in adjoint() 89 CALL_SUBTEST_1( adjoint(Matrix<float, 1, 1>()) ); in test_eigen2_adjoint() 90 CALL_SUBTEST_2( adjoint(Matrix3d()) ); in test_eigen2_adjoint() 91 CALL_SUBTEST_3( adjoint(Matrix4f()) ); in test_eigen2_adjoint() [all …]
|
D | eigen2_svd.cpp | 47 a += a * a.adjoint() + a1 * a1.adjoint(); in svd() 60 …VERIFY_IS_APPROX(unitary * unitary.adjoint(), MatrixType::Identity(unitary.rows(),unitary.rows())); in svd() 61 VERIFY_IS_APPROX(positive, positive.adjoint()); in svd() 66 …VERIFY_IS_APPROX(unitary * unitary.adjoint(), MatrixType::Identity(unitary.rows(),unitary.rows())); in svd() 67 VERIFY_IS_APPROX(positive, positive.adjoint()); in svd()
|
D | eigen2_qr.cpp | 31 SquareMatrixType b = a.adjoint() * a; 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_eigensolver.cpp | 35 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1; in selfadjointeigensolver() 39 MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1; in selfadjointeigensolver() 118 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1; in eigensolver()
|
D | eigen2_cholesky.cpp | 35 SquareMatrixType symm = a0 * a0.adjoint(); in cholesky() 38 symm += a1 * a1.adjoint(); in cholesky() 82 VERIFY_IS_APPROX(symm, chol.matrixL() * chol.matrixL().adjoint()); in cholesky() 93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint(); in cholesky()
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | RealQZ.h | 228 m_S.applyOnTheLeft(m_Q.adjoint()); in hessenbergTriangular() 241 m_S.rightCols(dim-j-1).applyOnTheLeft(i-1,i,G.adjoint()); in hessenbergTriangular() 242 m_T.rightCols(dim-i+1).applyOnTheLeft(i-1,i,G.adjoint()); in hessenbergTriangular() 256 m_Z.applyOnTheLeft(i,i-1,G.adjoint()); in hessenbergTriangular() 336 m_S.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint()); in splitOffTwoRows() 337 m_T.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint()); in splitOffTwoRows() 347 m_Z.applyOnTheLeft(i+1,i,G.adjoint()); in splitOffTwoRows() 370 m_S.rightCols(dim-firstColS).applyOnTheLeft(zz,zz+1,G.adjoint()); in pushDownZero() 371 m_T.rightCols(dim-zz).applyOnTheLeft(zz,zz+1,G.adjoint()); in pushDownZero() 385 m_Z.applyOnTheLeft(zz,zz-1,G.adjoint()); in pushDownZero() [all …]
|
/external/eigen/doc/snippets/ |
D | HouseholderSequence_HouseholderSequence.cpp | 15 Matrix3d H0 = Matrix3d::Identity() - h(0) * v0 * v0.adjoint(); 18 Matrix3d H1 = Matrix3d::Identity() - h(1) * v1 * v1.adjoint(); 21 Matrix3d H2 = Matrix3d::Identity() - h(2) * v2 * v2.adjoint();
|
D | LLT_solve.cpp | 7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
|
D | Jacobi_makeJacobi.cpp | 2 m = (m + m.adjoint()).eval(); 6 m.applyOnTheLeft(0, 1, J.adjoint());
|
D | RealQZ_compute.cpp | 15 << "\n|QQ* - I|: " << (qz.matrixQ()*qz.matrixQ().adjoint() - MatrixXf::Identity(4,4)).norm() 16 << ", |ZZ* - I|: " << (qz.matrixZ()*qz.matrixZ().adjoint() - MatrixXf::Identity(4,4)).norm()
|
/external/eigen/Eigen/src/Householder/ |
D | BlockHouseholder.h | 34 triFactor.col(i).head(i).noalias() = -hCoeffs(i) * vectors.block(i, 0, rs, i).adjoint() in make_block_householder_triangular_factor() 58 … VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat; in apply_block_householder_on_the_left() 60 tmp = T.template triangularView<Upper>().adjoint() * tmp; in apply_block_householder_on_the_left()
|