/external/eigen/doc/snippets/ |
H A D | SelfAdjointView_operatorNorm.cpp | 3 << ones.selfadjointView<Lower>().operatorNorm() << endl;
|
H A D | SelfAdjointView_eigenvalues.cpp | 2 VectorXd eivals = ones.selfadjointView<Lower>().eigenvalues();
|
H A D | MatrixBase_selfadjointView.cpp | 4 << Matrix3i(m.selfadjointView<Upper>()) << endl; 6 << Matrix3i(m.selfadjointView<Lower>()) << endl;
|
/external/eigen/test/ |
H A D | selfadjoint.cpp | 12 // This file tests the basic selfadjointView API, 31 m3 = m1.template selfadjointView<Upper>(); 35 m3 = m1.template selfadjointView<Lower>(); 39 m3 = m1.template selfadjointView<Upper>(); 41 m4 += m1.template selfadjointView<Upper>(); 44 m3 = m1.template selfadjointView<Lower>(); 46 m4 -= m1.template selfadjointView<Lower>(); 52 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
|
H A D | sparse_permutations.cpp | 67 up_sym_d = mat_d.template selfadjointView<Upper>(); 68 lo_sym_d = mat_d.template selfadjointView<Lower>(); 111 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p_null) )); 115 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p_null) )); 120 VERIFY( is_sorted( res = up.template selfadjointView<Upper>().twistedBy(p_null) )); 124 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>().twistedBy(p_null) )); 129 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>() )); 133 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>() )); 137 VERIFY( is_sorted( res = up.template selfadjointView<Upper>() )); 141 VERIFY( is_sorted( res = lo.template selfadjointView<Lowe [all...] |
H A D | product_symm.cpp | 37 m3 = m2.template selfadjointView<Lower>(); 39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), 42 VERIFY_IS_APPROX(rhs12 = (s1*m2).transpose().template selfadjointView<Upper>() * (s2*rhs1), 45 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().transpose() * (s2*rhs1), 48 VERIFY_IS_APPROX(rhs12 = (s1*m2).conjugate().template selfadjointView<Lower>() * (s2*rhs1), 51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().conjugate() * (s2*rhs1), 54 VERIFY_IS_APPROX(rhs12 = (s1*m2).adjoint().template selfadjointView<Upper>() * (s2*rhs1), 57 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().adjoint() * (s2*rhs1), 61 m3 = m2.template selfadjointView<Upper>(); 63 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Uppe [all...] |
H A D | product_syrk.cpp | 38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), 62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), 69 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(), 73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(), 77 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()), 81 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()), 84 VERIFY_IS_APPROX((rm2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()), 94 VERIFY_IS_APPROX((m2.template selfadjointView<Lowe [all...] |
H A D | eigensolver_selfadjoint.cpp | 35 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiSymm.eigenvectors())/scaling, 38 VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues()); 60 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiDirect.eigenvectors())/scaling, 62 VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues()/scaling, eiDirect.eigenvalues()/scaling); 111 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( 112 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps)); 117 VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( 123 VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lowe [all...] |
H A D | nomalloc.cpp | 69 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0); 70 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0); 71 m2.col(0).noalias() -= m1.template selfadjointView<Upper>() * m1.row(0).adjoint(); 72 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.row(0).adjoint(); 74 m2.row(0).noalias() = m1.row(0) * m1.template selfadjointView<Upper>(); 75 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template selfadjointView<Upper>(); 76 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template selfadjointView<Upper>(); 77 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template selfadjointView<Upper>(); 80 m2.template selfadjointView<Lower>().rankUpdate(m1.col(0),-1); 81 m2.template selfadjointView<Uppe [all...] |
H A D | product_selfadjoint.cpp | 42 m2.template selfadjointView<Lower>().rankUpdate(v1,v2); 46 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3); 50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1); 56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
|
H A D | product_notemporary.cpp | 89 VERIFY_EVALUATION_COUNT( m3.noalias() -= (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2*s3).adjoint(), 0); 90 VERIFY_EVALUATION_COUNT( m3.noalias() = s2 * m2.adjoint() * (s1 * m1.adjoint()).template selfadjointView<Upper>(), 0); 91 VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template selfadjointView<Lower>() * m2.adjoint(), 0); 94 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() = (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2.row(c0)*s3).adjoint(), 1); 95 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() -= (s1 * m1).adjoint().template selfadjointView<Upper>() * (-m2.row(c0)*s3).adjoint(), 1); 97 VERIFY_EVALUATION_COUNT( m3.block(r0,c0,r1,c1).noalias() += m1.block(r0,r0,r1,r1).template selfadjointView<Upper>() * (s1*m2.block(r0,c0,r1,c1)), 0); 98 VERIFY_EVALUATION_COUNT( m3.block(r0,c0,r1,c1).noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<Upper>() * m2.block(r0,c0,r1,c1), 0); 100 VERIFY_EVALUATION_COUNT( m3.template selfadjointView<Lower>().rankUpdate(m2.adjoint()), 0); 104 VERIFY_EVALUATION_COUNT( m3.noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<Lower>() * m2.block(r0,c0,r1,c1), 1);
|
H A D | cholesky.cpp | 22 MatrixType symm = m.template selfadjointView<UpLo>(); 131 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); 132 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); 134 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); 135 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); 137 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); 138 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); 140 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB); 141 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
|
H A D | sparse_product.cpp | 295 // sparse selfadjointView with dense matrices 296 VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b, refX=refS*b); 297 VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b, refX=refS*b); 298 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b); 300 VERIFY_IS_APPROX(x=b * mUp.template selfadjointView<Upper>(), refX=b*refS); 301 VERIFY_IS_APPROX(x=b * mLo.template selfadjointView<Lower>(), refX=b*refS); 302 VERIFY_IS_APPROX(x=b * mS.template selfadjointView<Upper|Lower>(), refX=b*refS); 304 VERIFY_IS_APPROX(x.noalias()+=mUp.template selfadjointView<Upper>()*b, refX+=refS*b); 305 VERIFY_IS_APPROX(x.noalias()-=mLo.template selfadjointView<Lower>()*b, refX-=refS*b); 306 VERIFY_IS_APPROX(x.noalias()+=mS.template selfadjointView<Uppe [all...] |
H A D | triangular.cpp | 125 VERIFY_IS_APPROX(m1.template selfadjointView<Upper>().template triangularView<Upper>().toDenseMatrix(), m1up); 126 VERIFY_IS_APPROX(m1up.template selfadjointView<Upper>().template triangularView<Upper>().toDenseMatrix(), m1up); 127 VERIFY_IS_APPROX(m1.template selfadjointView<Upper>().template triangularView<Lower>().toDenseMatrix(), m1up.adjoint()); 128 VERIFY_IS_APPROX(m1up.template selfadjointView<Upper>().template triangularView<Lower>().toDenseMatrix(), m1up.adjoint()); 130 VERIFY_IS_APPROX(m1.template selfadjointView<Upper>().diagonal(), m1.diagonal());
|
/external/eigen/unsupported/test/ |
H A D | mpreal_support.cpp | 43 X = S.selfadjointView<Lower>().llt().solve(B); 44 VERIFY_IS_APPROX((S.selfadjointView<Lower>()*X).eval(),B); 46 Xc = Sc.selfadjointView<Lower>().llt().solve(Bc); 47 VERIFY_IS_APPROX((Sc.selfadjointView<Lower>()*Xc).eval(),Bc); 56 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | GeneralizedSelfAdjointEigenSolver.h | 184 MatrixType matC = matA.template selfadjointView<Lower>(); 197 MatrixType matC = matA.template selfadjointView<Lower>(); 210 MatrixType matC = matA.template selfadjointView<Lower>();
|
H A D | MatrixBaseEigenvalues.h | 130 .template selfadjointView<Lower>()
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | IncompleteCholesky.h | 121 ord(mat.template selfadjointView<UpLo>(), pinv); 208 tmp = mat.template selfadjointView<_UpLo>().twistedBy(m_perm); 209 m_L.template selfadjointView<Lower>() = tmp.template selfadjointView<Lower>(); 213 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>();
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
H A D | MatrixMarketIterator.h | 98 m_mat = tmp.template selfadjointView<Lower>(); 104 m_mat = tmp.template selfadjointView<Upper>();
|
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky.h | 220 tmp.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P); 660 C = a.template selfadjointView<UpLo>(); 670 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P); 680 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>();
|
/external/eigen/Eigen/src/Core/ |
H A D | SelfAdjointView.h | 25 * with given dense storage of the coefficients. It is the return type of MatrixBase::selfadjointView() 28 * \sa class TriangularBase, MatrixBase::selfadjointView() 137 return (s*mat.nestedExpression()).template selfadjointView<UpLo>(); 322 /** This is the const version of MatrixBase::selfadjointView() */ 326 MatrixBase<Derived>::selfadjointView() const function in class:Eigen::MatrixBase 343 MatrixBase<Derived>::selfadjointView() function in class:Eigen::MatrixBase
|
/external/eigen/bench/spbench/ |
H A D | sp_solver.cpp | 51 A = temp.selfadjointView<Lower>();
|
H A D | test_sparseLU.cpp | 53 A = temp.selfadjointView<Lower>();
|
/external/eigen/Eigen/src/PaStiXSupport/ |
H A D | PaStiXSupport.h | 586 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>(); 671 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>();
|
/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 475 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null); 536 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
|