| /external/eigen/test/ |
| triangular.cpp | 1 // This file is triangularView of Eigen, a lightweight C++ template library
33 MatrixType m1up = m1.template triangularView<Upper>();
34 MatrixType m2up = m2.template triangularView<Upper>();
48 r1.template triangularView<Upper>() += m1;
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1);
60 m1.template triangularView<Lower>() = m2.transpose() + m2;
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1);
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(),
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix())
[all...] |
| product_trmv.cpp | 1 // This file is triangularView of Eigen, a lightweight C++ template library
33 m3 = m1.template triangularView<Eigen::Lower>();
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));
35 m3 = m1.template triangularView<Eigen::Upper>();
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));
37 m3 = m1.template triangularView<Eigen::UnitLower>();
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps));
39 m3 = m1.template triangularView<Eigen::UnitUpper>();
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps));
43 m3 = m1.template triangularView<Eigen::Lower>()
[all...] |
| product_mmtr.cpp | 15 DEST.template triangularView<TRI>() OP; \
17 ref2.template triangularView<TRI>() \
18 = ref1.template triangularView<TRI>(); \
24 DEST.template triangularView<TRI|ZeroDiag>() OP; \
63 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>());
64 CHECK_MMTR(matc, Upper, = s*sqc*sqr.template triangularView<Upper>());
65 CHECK_MMTR(matc, Lower, += s*sqr*sqc.template triangularView<Lower>());
66 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>());
68 CHECK_MMTR(matc, Lower, = (s*sqr).template triangularView<Upper>()*sqc);
69 CHECK_MMTR(matc, Upper, -= (s*sqc).template triangularView<Upper>()*sqc)
[all...] |
| sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2),
54 m2.template triangularView<Lower>().solve(vec3));
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2),
59 m2.template triangularView<Upper>().solve(vec3));
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
61 m2.conjugate().template triangularView<Upper>().solve(vec3));
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
67 mm2.conjugate().template triangularView<Upper>().solve(vec3));
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2),
73 m2.transpose().template triangularView<Upper>().solve(vec3))
[all...] |
| product_syrk.cpp | 39 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
41 VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpression()),
42 ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
47 (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix());
49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(),
50 (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix());
55 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
57 VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpression(),
58 (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
63 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix())
[all...] |
| product_trsolve.cpp | 46 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Lower>(), cmRhs);
47 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Lower>(), cmRhs);
48 VERIFY_TRSM(cmLhs .template triangularView<Upper>(), cmRhs);
49 VERIFY_TRSM(cmLhs .template triangularView<Lower>(), rmRhs);
50 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Upper>(), rmRhs);
51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs);
53 VERIFY_TRSM(cmLhs.conjugate().template triangularView<UnitLower>(), cmRhs);
54 VERIFY_TRSM(cmLhs .template triangularView<UnitUpper>(), rmRhs);
56 VERIFY_TRSM(rmLhs .template triangularView<Lower>(), cmRhs);
57 VERIFY_TRSM(rmLhs.conjugate().template triangularView<UnitUpper>(), rmRhs)
[all...] |
| selfadjoint.cpp | 1 // This file is triangularView of Eigen, a lightweight C++ template library
32 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>()));
36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
|
| product_trmm.cpp | 43 tri = mat.template triangularView<Mode>();
44 triTr = mat.transpose().template triangularView<Mode>();
48 VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
49 VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
51 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
52 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
54 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
55 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
57 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr.conjugate() * (s2*ge_left.adjoint()));
58 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate())
[all...] |
| product_selfadjoint.cpp | 41 m2 = m1.template triangularView<Lower>();
43 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
45 m2 = m1.template triangularView<Upper>();
47 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+numext::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
49 m2 = m1.template triangularView<Upper>();
51 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + numext::conj(s1)*(r2.adjoint()*s3) * (-s2*r1.adjoint()).adjoint()).template triangularView<Upper>().toDenseMatrix());
55 m2 = m1.template triangularView<Lower>();
59 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
|
| product_symm.cpp | 36 m2 = m1.template triangularView<Lower>();
60 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
66 m2 = m1.template triangularView<Lower>();
70 m2 = m1.template triangularView<Upper>();
74 m2 = m1.template triangularView<Upper>();
79 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12;
83 m2 = m1.template triangularView<Upper>();
88 m2 = m1.template triangularView<Upper>(); rhs13 = rhs12;
92 m2 = m1.template triangularView<Lower>();
|
| sparse_permutations.cpp | 64 up = mat.template triangularView<Upper>();
65 lo = mat.template triangularView<Lower>();
71 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>()));
72 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>()));
147 res_d = up_sym_d.template triangularView<Upper>();
151 res_d = up_sym_d.template triangularView<Lower>();
155 res_d = lo_sym_d.template triangularView<Upper>();
159 res_d = lo_sym_d.template triangularView<Lower>();
165 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();
169 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>()
[all...] |
| mixingtypes.cpp | 194 VERIFY_IS_APPROX( sd*vcd.adjoint()*md.template triangularView<Upper>(), sd*vcd.adjoint()*md.template cast<CD>().eval().template triangularView<Upper>());
195 VERIFY_IS_APPROX(scd*vcd.adjoint()*md.template triangularView<Lower>(), scd*vcd.adjoint()*md.template cast<CD>().eval().template triangularView<Lower>());
196 VERIFY_IS_APPROX( sd*vcd.adjoint()*md.transpose().template triangularView<Upper>(), sd*vcd.adjoint()*md.transpose().template cast<CD>().eval().template triangularView<Upper>());
197 VERIFY_IS_APPROX(scd*vcd.adjoint()*md.transpose().template triangularView<Lower>(), scd*vcd.adjoint()*md.transpose().template cast<CD>().eval().template triangularView<Lower>());
198 VERIFY_IS_APPROX( sd*vd.adjoint()*mcd.template triangularView<Lower>(), sd*vd.adjoint().template cast<CD>().eval()*mcd.template triangularView<Lower>())
[all...] |
| /external/eigen/doc/snippets/ |
| Triangular_solve.cpp | 2 m.triangularView<Eigen::Upper>().setOnes();
5 n.triangularView<Eigen::Lower>() *= 2;
9 << m.triangularView<Eigen::Upper>().solve(n) << endl;
11 << m.triangularView<Eigen::Upper>().solve<Eigen::OnTheRight>(n);
|
| MatrixBase_triangularView.cpp | 4 << Matrix3i(m.triangularView<Eigen::Upper>()) << endl;
6 << Matrix3i(m.triangularView<Eigen::StrictlyUpper>()) << endl;
8 << Matrix3i(m.triangularView<Eigen::UnitLower>()) << endl;
|
| Tutorial_solve_triangular_inplace.cpp | 5 A.triangularView<Upper>().solveInPlace(b);
|
| Tutorial_solve_triangular.cpp | 7 Vector3f x = A.triangularView<Upper>().solve(b);
|
| class_FullPivLU.cpp | 10 l.block<5,3>(0,0).triangularView<StrictlyLower>() = lu.matrixLU();
13 Matrix5x3 u = lu.matrixLU().triangularView<Upper>();
|
| /external/eigen/failtest/ |
| triangularview_nonconst_ctor_on_const_xpr.cpp | 12 TriangularView<Matrix3d,Upper> t(m);
|
| triangularview_on_const_type_actually_const.cpp | 13 TriangularView<CV_QUALIFIER MatrixXf,Upper>(m).coeffRef(0, 0) = 1.0f;
|
| /external/eigen/doc/examples/ |
| TemplateKeyword_simple.cpp | 8 dst.triangularView<Upper>() = src.triangularView<Upper>();
|
| TemplateKeyword_flexible.cpp | 10 dst.template triangularView<Upper>() = src.template triangularView<Upper>();
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 20 * This class is an abstract base class of class TriangularView, and objects of type TriangularViewImpl cannot be instantiated.
21 * It extends class TriangularView with additional methods which are available for sparse expressions only.
23 * \sa class TriangularView, SparseMatrixBase::triangularView()
26 : public SparseMatrixBase<TriangularView<MatrixType,Mode> >
35 typedef TriangularView<MatrixType,Mode> TriangularViewType;
38 // dummy solve function to make TriangularView happy.
69 struct unary_evaluator<TriangularView<ArgType,Mode>, IteratorBased>
70 : evaluator_base<TriangularView<ArgType,Mode> >
72 typedef TriangularView<ArgType,Mode> XprType
[all...] |
| /external/eigen/lapack/ |
| lu.cpp | 70 lu.triangularView<UnitLower>().solveInPlace(B);
71 lu.triangularView<Upper>().solveInPlace(B);
75 lu.triangularView<Upper>().transpose().solveInPlace(B);
76 lu.triangularView<UnitLower>().transpose().solveInPlace(B);
81 lu.triangularView<Upper>().adjoint().solveInPlace(B);
82 lu.triangularView<UnitLower>().adjoint().solveInPlace(B);
|
| cholesky.cpp | 62 A.triangularView<Upper>().adjoint().solveInPlace(B);
63 A.triangularView<Upper>().solveInPlace(B);
67 A.triangularView<Lower>().solveInPlace(B);
68 A.triangularView<Lower>().adjoint().solveInPlace(B);
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 150 /** \class TriangularView
163 * of MatrixBase::triangularView() and SparseMatrixBase::triangularView(), and most of the time this is the only way it is used.
165 * \sa MatrixBase::triangularView()
169 struct traits<TriangularView<MatrixType, _Mode> > : traits<MatrixType>
186 template<typename _MatrixType, unsigned int _Mode> class TriangularView
192 typedef typename internal::traits<TriangularView>::Scalar Scalar;
196 typedef typename internal::traits<TriangularView>::MatrixTypeNested MatrixTypeNested;
197 typedef typename internal::traits<TriangularView>::MatrixTypeNestedNonRef MatrixTypeNestedNonRef;
203 typedef typename internal::traits<TriangularView>::StorageKind StorageKind
[all...] |
