| /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();
|
| /external/eigen/test/ |
| H A D | sparse_permutations.cpp | 35 up_sym_d = mat_d.template selfadjointView<Upper>();
36 lo_sym_d = mat_d.template selfadjointView<Lower>();
68 res = mat.template selfadjointView<Upper>().twistedBy(p_null);
72 res = mat.template selfadjointView<Lower>().twistedBy(p_null);
77 res = up.template selfadjointView<Upper>().twistedBy(p_null);
81 res = lo.template selfadjointView<Lower>().twistedBy(p_null);
86 res = mat.template selfadjointView<Upper>();
90 res = mat.template selfadjointView<Lower>();
94 res = up.template selfadjointView<Upper>();
98 res = lo.template selfadjointView<Lowe
[all...] |
| H A D | eigensolver_selfadjoint.cpp | 60 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(
62 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());
65 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(
67 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());
76 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
77 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));
82 VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
88 VERIFY((symmC.template selfadjointView<Lower>() * (symmB.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),
43 m3 = m2.template selfadjointView<Upper>();
45 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1),
49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()),
57 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
62 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3),
66 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(),
71 VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lowe
[all...] |
| H A D | selfadjoint.cpp | 12 // This file tests the basic selfadjointView API,
29 m3 = m1.template selfadjointView<Upper>();
34 m3 = m1.template selfadjointView<Lower>();
41 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
|
| 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 | product_notemporary.cpp | 90 VERIFY_EVALUATION_COUNT( m3.noalias() -= (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2*s3).adjoint(), 0);
91 VERIFY_EVALUATION_COUNT( m3.noalias() = s2 * m2.adjoint() * (s1 * m1.adjoint()).template selfadjointView<Upper>(), 0);
92 VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template selfadjointView<Lower>() * m2.adjoint(), 0);
95 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() = (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2.row(c0)*s3).adjoint(), 1);
96 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() -= (s1 * m1).adjoint().template selfadjointView<Upper>() * (-m2.row(c0)*s3).adjoint(), 1);
98 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);
99 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);
101 VERIFY_EVALUATION_COUNT( m3.template selfadjointView<Lower>().rankUpdate(m2.adjoint()), 0);
105 VERIFY_EVALUATION_COUNT( m3.noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<Lower>() * m2.block(r0,c0,r1,c1), 1);
|
| 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 | nomalloc.cpp | 79 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0);
80 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0);
81 m2.col(0).noalias() -= m1.template selfadjointView<Upper>() * m1.row(0).adjoint();
82 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.row(0).adjoint();
84 m2.row(0).noalias() = m1.row(0) * m1.template selfadjointView<Upper>();
85 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template selfadjointView<Upper>();
86 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template selfadjointView<Upper>();
87 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template selfadjointView<Upper>();
90 m2.template selfadjointView<Lower>().rankUpdate(m1.col(0),-1);
91 m2.template selfadjointView<Lowe
[all...] |
| H A D | cholesky.cpp | 121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB);
128 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
130 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
131 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
|
| H A D | sparse_product.cpp | 205 VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b, refX=refS*b);
206 VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b, refX=refS*b);
207 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b);
209 // sparse selfadjointView * sparse
211 VERIFY_IS_APPROX(mSres = mLo.template selfadjointView<Lower>()*mS,
212 refX = refLo.template selfadjointView<Lower>()*refS);
214 VERIFY_IS_APPROX(mSres = mS * mLo.template selfadjointView<Lower>(),
215 refX = refS * refLo.template selfadjointView<Lower>());
|
| /external/eigen/unsupported/test/ |
| H A D | mpreal_support.cpp | 38 X = S.selfadjointView<Lower>().llt().solve(B);
39 VERIFY_IS_APPROX((S.selfadjointView<Lower>()*X).eval(),B);
48 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 | 185 MatrixType matC = matA.template selfadjointView<Lower>();
198 MatrixType matC = matA.template selfadjointView<Lower>();
211 MatrixType matC = matA.template selfadjointView<Lower>();
|
| H A D | MatrixBaseEigenvalues.h | 130 .template selfadjointView<Lower>()
|
| /external/ceres-solver/internal/ceres/ |
| H A D | dense_normal_cholesky_solver.cc | 85 lhs.selfadjointView<Eigen::Upper>().rankUpdate(Aref.transpose());
100 lhs.selfadjointView<Eigen::Upper>().llt();
|
| H A D | line_search_direction.cc | 299 inverse_hessian_.selfadjointView<Eigen::Lower>());
304 inverse_hessian_.selfadjointView<Eigen::Lower>() *
308 B.selfadjointView<Eigen::Lower>().
319 inverse_hessian_.selfadjointView<Eigen::Lower>() *
|
| H A D | implicit_schur_complement_test.cc | 112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs);
162 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
|
| H A D | block_jacobi_preconditioner.cc | 98 // .selfadjointView<Eigen::Upper>()
115 block = block.selfadjointView<Eigen::Upper>()
|
| H A D | schur_jacobi_preconditioner.cc | 120 .selfadjointView<Eigen::Upper>()
|
| H A D | schur_eliminator_test.cc | 162 .selfadjointView<Eigen::Upper>()
176 Matrix delta = (lhs_ref - lhs_expected).selfadjointView<Eigen::Upper>();
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| H A D | IncompleteCholesky.h | 77 ord(mat.template selfadjointView<UpLo>(), m_perm);
142 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>().twistedBy(m_perm);
144 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>();
|
| /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/SparseCholesky/ |
| H A D | SimplicialCholesky.h | 201 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
624 C = a.template selfadjointView<UpLo>();
636 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
|