HomeSort by relevance Sort by last modified time
    Searched refs:Upper (Results 1 - 25 of 198) sorted by null

1 2 3 4 5 6 7 8

  /external/eigen/doc/snippets/
Triangular_solve.cpp 2 m.triangularView<Eigen::Upper>().setOnes();
8 " m is upper-triangular:\n"
9 << m.triangularView<Eigen::Upper>().solve(n) << endl;
11 << m.triangularView<Eigen::Upper>().solve<Eigen::OnTheRight>(n);
Tutorial_solve_triangular_inplace.cpp 5 A.triangularView<Upper>().solveInPlace(b);
MatrixBase_selfadjointView.cpp 3 cout << "Here is the symmetric matrix extracted from the upper part of m:" << endl
4 << Matrix3i(m.selfadjointView<Upper>()) << endl;
MatrixBase_triangularView.cpp 3 cout << "Here is the upper-triangular matrix extracted from m:" << endl
4 << Matrix3i(m.triangularView<Eigen::Upper>()) << endl;
5 cout << "Here is the strictly-upper-triangular matrix extracted from m:" << endl
Tutorial_solve_triangular.cpp 7 Vector3f x = A.triangularView<Upper>().solve(b);
  /external/eigen/failtest/
selfadjointview_nonconst_ctor_on_const_xpr.cpp 12 SelfAdjointView<Matrix3d,Upper> t(m);
triangularview_nonconst_ctor_on_const_xpr.cpp 12 TriangularView<Matrix3d,Upper> t(m);
selfadjointview_on_const_type_actually_const.cpp 13 SelfAdjointView<CV_QUALIFIER MatrixXf,Upper>(m).coeffRef(0, 0) = 1.0f;
triangularview_on_const_type_actually_const.cpp 13 TriangularView<CV_QUALIFIER MatrixXf,Upper>(m).coeffRef(0, 0) = 1.0f;
  /external/swiftshader/third_party/LLVM/lib/Support/
ConstantRange.cpp 11 // for an integral value. This keeps track of a lower and upper bound for the
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
34 Lower = Upper = APInt::getMaxValue(BitWidth);
36 Lower = Upper = APInt::getMinValue(BitWidth);
41 ConstantRange::ConstantRange(const APInt &V) : Lower(V), Upper(V + 1) {}
44 Lower(L), Upper(U) {
48 "Lower == Upper, but they aren't min or max value!");
119 return Lower == Upper && Lower.isMaxValue();
125 return Lower == Upper && Lower.isMinValue();
132 return Lower.ugt(Upper);
    [all...]
  /external/eigen/test/
cholmod_support.cpp 18 CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(CholmodSupernodalLLt);
20 CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(CholmodSimplicialLLt);
22 CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(CholmodLDLt);
25 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper;
27 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper;
29 CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper;
triangular.cpp 33 MatrixType m1up = m1.template triangularView<Upper>();
34 MatrixType m2up = m2.template triangularView<Upper>();
43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
48 r1.template triangularView<Upper>() += m1;
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
72 m3 = m1.template triangularView<Upper>();
75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps));
76 m3 = m1.template triangularView<Upper>();
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps));
82 m3 = m1.template triangularView<Upper>();
    [all...]
conjugate_gradient.cpp 17 ConjugateGradient<SparseMatrixType, Upper > cg_colmajor_upper_diag;
18 ConjugateGradient<SparseMatrixType, Lower|Upper> cg_colmajor_loup_diag;
20 ConjugateGradient<SparseMatrixType, Upper, IdentityPreconditioner> cg_colmajor_upper_I;
incomplete_cholesky.cpp 20 ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I> > > cg_illt_upper_amd;
21 ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I> > > cg_illt_upper_nat;
22 ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_uplo_amd;
59 Eigen::Lower | Eigen::Upper,
product_mmtr.cpp 42 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint()));
44 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint()));
47 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose()));
49 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint()));
52 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate()));
54 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint()));
56 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>());
57 CHECK_MMTR(matc, Upper, = s*sqc*sqr.template triangularView<Upper>());
59 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>())
    [all...]
product_syrk.cpp 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(),
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());
62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(),
63 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix());
64 VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpression(),
65 (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix());
73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(),
74 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Upper>().toDenseMatrix())
    [all...]
simplicial_cholesky.cpp 16 SimplicialCholesky<SparseMatrixType, Upper> chol_colmajor_upper_amd;
18 SimplicialLLT< SparseMatrixType, Upper> llt_colmajor_upper_amd;
20 SimplicialLDLT< SparseMatrixType, Upper> ldlt_colmajor_upper_amd;
22 SimplicialLDLT< SparseMatrixType, Upper, NaturalOrdering<I> > ldlt_colmajor_upper_nat;
selfadjoint.cpp 31 m3 = m1.template selfadjointView<Upper>();
32 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>()));
39 m3 = m1.template selfadjointView<Upper>();
41 m4 += m1.template selfadjointView<Upper>();
  /external/llvm/lib/IR/
ConstantRange.cpp 11 // for an integral value. This keeps track of a lower and upper bound for the
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
36 Lower = Upper = APInt::getMaxValue(BitWidth);
38 Lower = Upper = APInt::getMinValue(BitWidth);
44 : Lower(std::move(V)), Upper(Lower + 1) {}
47 : Lower(std::move(L)), Upper(std::move(U)) {
48 assert(Lower.getBitWidth() == Upper.getBitWidth() &&
50 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) &&
51 "Lower == Upper, but they aren't min or max value!");
230 return Lower == Upper && Lower.isMaxValue()
    [all...]
  /external/llvm/include/llvm/Support/
UnicodeCharRanges.h 26 /// \brief Represents a closed range of Unicode code points [Lower, Upper].
29 uint32_t Upper;
36 return Range.Upper < Value;
80 DEBUG(dbgs() << "Upper bound 0x");
86 if (I->Upper < I->Lower) {
87 DEBUG(dbgs() << "Upper bound 0x");
90 DEBUG(dbgs().write_hex(I->Upper) << "\n");
93 Prev = I->Upper;
  /external/eigen/unsupported/test/
minres.cpp 19 MINRES<SparseMatrix<T>, Upper, IdentityPreconditioner > minres_colmajor_upper_I;
23 MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_upper_diag;
24 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
  /external/swiftshader/third_party/LLVM/include/llvm/Support/
ConstantRange.h 11 // for an integral value. This keeps track of a lower and upper bound for the
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
43 APInt Lower, Upper;
55 /// Lower==Upper and Lower != Min or Max value for its type. It will also
57 ConstantRange(const APInt &Lower, const APInt &Upper);
73 /// getUpper - Return the upper value for this range...
75 const APInt &getUpper() const { return Upper; }
112 if (Upper == Lower + 1)
148 return Lower == CR.Lower && Upper == CR.Upper;
    [all...]
  /external/eigen/doc/examples/
TemplateKeyword_flexible.cpp 10 dst.template triangularView<Upper>() = src.template triangularView<Upper>();
TemplateKeyword_simple.cpp 8 dst.triangularView<Upper>() = src.triangularView<Upper>();
  /external/icu/icu4c/source/test/testdata/break_rules/
sentence.txt 18 Upper = [\p{Sentence_Break = Upper}];
42 SB7: (Upper | Lower) ExtFmt* ATerm ExtFmt* Upper;
43 SB8: ATerm ExtFmt* (Close ExtFmt*)* (Sp ExtFmt*)* ([^OLetter Upper Lower ParaSep SATerm ExtFmt] ExtFmt *)* Lower;

Completed in 539 milliseconds

1 2 3 4 5 6 7 8