Home
last modified time | relevance | path

Searched refs:adjoint (Results 1 – 25 of 118) sorted by relevance

12345

/external/eigen/test/
Dproduct_syrk.cpp39 … ((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 …]
Dmixingtypes.cpp160 VERIFY_IS_APPROX(sd*md.adjoint()*mcd, (sd*md).template cast<CD>().eval().adjoint()*mcd); in mixingtypes()
161 VERIFY_IS_APPROX(sd*mcd.adjoint()*md, sd*mcd.adjoint()*md.template cast<CD>()); in mixingtypes()
162 …VERIFY_IS_APPROX(sd*md.adjoint()*mcd.adjoint(), (sd*md).template cast<CD>().eval().adjoint()*mcd.a… in mixingtypes()
163 …VERIFY_IS_APPROX(sd*mcd.adjoint()*md.adjoint(), sd*mcd.adjoint()*md.template cast<CD>().adjoint()); in mixingtypes()
164 VERIFY_IS_APPROX(sd*md*mcd.adjoint(), (sd*md).template cast<CD>().eval()*mcd.adjoint()); in mixingtypes()
165 VERIFY_IS_APPROX(sd*mcd*md.adjoint(), sd*mcd*md.template cast<CD>().adjoint()); in mixingtypes()
167 VERIFY_IS_APPROX(sf*mf.adjoint()*mcf, (sf*mf).template cast<CF>().eval().adjoint()*mcf); in mixingtypes()
168 VERIFY_IS_APPROX(sf*mcf.adjoint()*mf, sf*mcf.adjoint()*mf.template cast<CF>()); in mixingtypes()
169 …VERIFY_IS_APPROX(sf*mf.adjoint()*mcf.adjoint(), (sf*mf).template cast<CF>().eval().adjoint()*mcf.a… in mixingtypes()
170 …VERIFY_IS_APPROX(sf*mcf.adjoint()*mf.adjoint(), sf*mcf.adjoint()*mf.template cast<CF>().adjoint()); in mixingtypes()
[all …]
Dadjoint.cpp23 VERIFY(test_isApproxWithRef(v1.dot(square * v2), (square.adjoint() * v1).dot(v2), 0)); in run()
58 …)((std::max)(v1.norm(),v2.norm()),(std::max)((square * v2).norm(),(square.adjoint() * v1).norm())); in run()
59 …VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref… in run()
67 template<typename MatrixType> void adjoint(const MatrixType& m) in adjoint() function
96 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint()
97 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint()
100 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1); in adjoint()
101 VERIFY_IS_APPROX((s1 * m1).adjoint(), numext::conj(s1) * m1.adjoint()); in adjoint()
115 VERIFY_IS_APPROX(m1.adjoint()(c,r), numext::conj(m1(r,c))); in adjoint()
138 VERIFY_IS_APPROX(m3,m1.adjoint()); in adjoint()
[all …]
Dproduct_notemporary.cpp45 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary()
46 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()).transpose(), 1); in product_notemporary()
47 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary()
53 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()), 1); in product_notemporary()
54 VERIFY_EVALUATION_COUNT( m3 = m3 - (m1 * m2.adjoint()), 1); in product_notemporary()
56 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()).transpose(), 1); in product_notemporary()
64 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); in product_notemporary()
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); in product_notemporary()
66 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); in product_notemporary()
67 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); in product_notemporary()
[all …]
Dproduct_extra.cpp41 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 …]
Dproduct_selfadjoint.cpp38 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()
Dnomalloc.cpp48 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc()
49 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc()
50 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc()
53 m2.row(0).noalias() -= m1.row(0) * m1.adjoint(); in nomalloc()
54 m2.row(0).noalias() -= m1.col(0).adjoint() * m1; in nomalloc()
55 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint(); in nomalloc()
59 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0); in nomalloc()
60 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
61 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
64 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>(); in nomalloc()
[all …]
Dproduct_trmm.cpp54 …VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_le… in trmm()
55 …VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<M… in trmm()
57 ….noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr… in trmm()
58 …_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), … in trmm()
61 …gate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangular… in trmm()
64 …ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noalias() -= (ge_right… in trmm()
66 … ge_xs = (s1*mat).adjoint().template triangularView<Mode>() * ge_left.adjoint(), numext::conj(s1) … in trmm()
Deigensolver_generalized_real.cpp33 MatrixType spdA = a.adjoint() * a + a1.adjoint() * a1; in generalized_eigensolver_real()
34 MatrixType spdB = b.adjoint() * b + b1.adjoint() * b1; in generalized_eigensolver_real()
75 GeneralizedSelfAdjointEigenSolver<MatrixType> eig1(a.adjoint() * a,b.adjoint() * b); in generalized_eigensolver_real()
76 eig1.compute(a.adjoint() * a,b.adjoint() * b); in generalized_eigensolver_real()
77 GeneralizedEigenSolver<MatrixType> eig2(a.adjoint() * a,b.adjoint() * b); in generalized_eigensolver_real()
78 eig2.compute(a.adjoint() * a,b.adjoint() * b); in generalized_eigensolver_real()
Dproduct_mmtr.cpp48 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint()); in mmtr()
49 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint())); in mmtr()
50 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint()); in mmtr()
51 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint())); in mmtr()
53 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint()); in mmtr()
55 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint()); in mmtr()
56 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint())); in mmtr()
58 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint()); in mmtr()
60 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint()); in mmtr()
61 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint())); in mmtr()
[all …]
Dproduct_symm.cpp27 m1 = (m1+m1.adjoint()).eval(); in symm()
54 VERIFY_IS_APPROX(rhs12 = (s1*m2).adjoint().template selfadjointView<Upper>() * (s2*rhs1), in symm()
55 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm()
57 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().adjoint() * (s2*rhs1), in symm()
58 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm()
67 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
68 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
71 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
72 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
75 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
[all …]
Dproduct_trmv.cpp60 …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()
Dupperbidiagonalization.cpp26 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()
Dlu.cpp92 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image); in lu_non_invertible()
113 m2 = m1.adjoint()*m3; in lu_non_invertible()
116 VERIFY_IS_APPROX(m2, m1.adjoint()*m3); in lu_non_invertible()
118 m3 = lu.adjoint().solve(m2); in lu_non_invertible()
119 VERIFY_IS_APPROX(m2, m1.adjoint()*m3); in lu_non_invertible()
169 VERIFY_IS_APPROX(m3, m1.adjoint()*m2); in lu_invertible()
171 m3 = lu.adjoint().solve(m2); in lu_invertible()
172 VERIFY_IS_APPROX(m2, m1.adjoint()*m3); in lu_invertible()
214 VERIFY_IS_APPROX(m3, m1.adjoint()*m2); in lu_partial_piv()
216 m3 = plu.adjoint().solve(m2); in lu_partial_piv()
[all …]
Deigensolver_selfadjoint.cpp85 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1; in selfadjointeigensolver()
95 MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1; in selfadjointeigensolver()
158 …Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint()); in selfadjointeigensolver()
159 …te selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint()); in selfadjointeigensolver()
180 SelfAdjointEigenSolver<MatrixType> eig(a.adjoint() * a); in selfadjointeigensolver()
181 eig.compute(a.adjoint() * a); in selfadjointeigensolver()
Dsvd_common.h51 VERIFY_IS_APPROX(m/scaling, u * (sigma/scaling) * v.adjoint()); in svd_check_full()
75 VERIFY( (svd.matrixV().adjoint()*svd.matrixV()).isIdentity(prec) ); in svd_compare_to_full()
76 …eftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint(), in svd_compare_to_full()
77 … referenceSvd.singularValues().asDiagonal() * referenceSvd.matrixV().leftCols(diagSize).adjoint()); in svd_compare_to_full()
82 VERIFY( (svd.matrixU().adjoint()*svd.matrixU()).isIdentity(prec) ); in svd_compare_to_full()
83 …Size) * svd.singularValues().cwiseAbs2().asDiagonal() * svd.matrixU().leftCols(diagSize).adjoint(), in svd_compare_to_full()
84 …d.singularValues().cwiseAbs2().asDiagonal() * referenceSvd.matrixU().leftCols(diagSize).adjoint()); in svd_compare_to_full()
138 VERIFY_IS_APPROX(m.adjoint()*(m*x),m.adjoint()*rhs); in svd_least_square()
198 HouseholderQR<MatrixType2T> qr(m2.adjoint()); in svd_min_norm()
199 …mp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2); in svd_min_norm()
[all …]
Dgeo_orthomethods.cpp55 …VERIFY_IS_MUCH_SMALLER_THAN((mat3.adjoint() * mat3.colwise().cross(vec3)).diagonal().cwiseAbs().su… in orthomethods_3()
56 …VERIFY_IS_MUCH_SMALLER_THAN((mat3.adjoint() * mat3.colwise().cross(Vector3::Random())).diagonal().… in orthomethods_3()
58 …VERIFY_IS_MUCH_SMALLER_THAN((vec3.adjoint() * mat3.colwise().cross(vec3)).cwiseAbs().sum(), Scalar… in orthomethods_3()
59 …VERIFY_IS_MUCH_SMALLER_THAN((vec3.adjoint() * Matrix3::Random().colwise().cross(vec3)).cwiseAbs().… in orthomethods_3()
/external/eigen/lapack/
Dsvd.cpp63 matrix(vt,*n,*n,*ldvt) = svd.matrixV().adjoint();
68 matrix(vt,diag_size,*n,*ldvt) = svd.matrixV().adjoint();
73 matrix(vt,*n,*n,*ldvt) = svd.matrixV().adjoint();
78 matrix(a,diag_size,*n,*lda) = svd.matrixV().adjoint();
133 if(*jobv=='A') matrix(vt,*n,*n,*ldvt) = svd.matrixV().adjoint();
134 else if(*jobv=='S') matrix(vt,diag_size,*n,*ldvt) = svd.matrixV().adjoint();
135 else if(*jobv=='O') matrix(a,diag_size,*n,*lda) = svd.matrixV().adjoint();
/external/eigen/Eigen/src/Eigenvalues/
DRealQZ.h228 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/Eigen/src/SVD/
DUpperBidiagonalization.h186 v_k -= V_k1 * Y.row(k).head(k).adjoint(); in upperbidiagonalization_blocked_helper()
207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper()
208 tmp.noalias() = V_k1.adjoint() * v_k; in upperbidiagonalization_blocked_helper()
210 tmp.noalias() = X_k1.adjoint() * v_k; in upperbidiagonalization_blocked_helper()
211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper()
219 u_k -= Y_k * A.row(k).head(k+1).adjoint(); in upperbidiagonalization_blocked_helper()
220 if(k) u_k -= U_k1.adjoint() * X.row(k).head(k).adjoint(); in upperbidiagonalization_blocked_helper()
242 tmp1.noalias() = Y_k.adjoint() * u_k.transpose(); in upperbidiagonalization_blocked_helper()
269 A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint(); in upperbidiagonalization_blocked_helper()
/external/eigen/doc/snippets/
DHouseholderSequence_HouseholderSequence.cpp15 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();
DLLT_solve.cpp7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
DJacobi_makeJacobi.cpp2 m = (m + m.adjoint()).eval();
6 m.applyOnTheLeft(0, 1, J.adjoint());
DRealQZ_compute.cpp15 << "\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/
DBlockHouseholder.h63 triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint() in make_block_householder_triangular_factor()
92 … VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat; in apply_block_householder_on_the_left()
95 else tmp = T.template triangularView<Upper>().adjoint() * tmp; in apply_block_householder_on_the_left()

12345