Searched refs:Lower (Results 1 - 25 of 96) sorted by relevance

1234

/external/eigen/doc/snippets/
H A DSelfAdjointView_operatorNorm.cpp3 << ones.selfadjointView<Lower>().operatorNorm() << endl;
H A DSelfAdjointView_eigenvalues.cpp2 VectorXd eivals = ones.selfadjointView<Lower>().eigenvalues();
/external/llvm/lib/Support/
H A DConstantRange.cpp34 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
[all...]
/external/eigen/test/
H A Dcholmod_support.cpp16 CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(CholmodSupernodalLLt);
18 CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(CholmodSimplicialLLt);
20 CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(CholmodLDLt);
23 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower;
25 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
27 CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
H A Dsparse_permutations.cpp33 lo = mat.template triangularView<Lower>();
36 lo_sym_d = mat_d.template selfadjointView<Lower>();
40 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>()));
72 res = mat.template selfadjointView<Lower>().twistedBy(p_null);
81 res = lo.template selfadjointView<Lower>().twistedBy(p_null);
90 res = mat.template selfadjointView<Lower>();
98 res = lo.template selfadjointView<Lower>();
107 res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>();
108 res_d = up_sym_d.template triangularView<Lower>();
111 res.template selfadjointView<Upper>() = mat.template selfadjointView<Lower>();
[all...]
H A Dsimplicial_cholesky.cpp14 SimplicialCholesky<SparseMatrix<T>, Lower> chol_colmajor_lower;
16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
H A Dconjugate_gradient.cpp15 ConjugateGradient<SparseMatrix<T>, Lower> cg_colmajor_lower_diag;
17 ConjugateGradient<SparseMatrix<T>, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
H A Dpardiso_support.cpp10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower;
12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower;
H A Dselfadjoint.cpp35 m3 = m1.template selfadjointView<Lower>();
36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
42 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
H A Deigensolver_selfadjoint.cpp49 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(
51 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());
54 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(
56 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());
65 VERIFY((symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
66 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));
71 VERIFY((symmB.template selfadjointView<Lower>() * (symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
77 VERIFY((symmA.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGe
[all...]
H A Dproduct_mmtr.cpp40 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint());
42 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint());
45 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint());
47 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint());
50 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint());
52 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint());
H A Dproduct_symm.cpp38 m2 = m1.template triangularView<Lower>();
39 m3 = m2.template selfadjointView<Lower>();
41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
50 m2 = m1.template triangularView<Lower>();
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
59 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
63 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12;
64 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3),
68 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(),
73 VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s
[all...]
H A Dpastix_support.cpp17 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower;
18 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower;
H A Dproduct_syrk.cpp36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
37 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
45 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
52 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(),
53 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix());
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
61 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
68 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expression()),
69 ((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Lower>()
[all...]
H A Dproduct_trmv.cpp33 m3 = m1.template triangularView<Eigen::Lower>();
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));
43 m3 = m1.template triangularView<Eigen::Lower>();
44 VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps));
50 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));
51 m3 = m1.template triangularView<Eigen::Lower>();
60 VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, largerEps));
61 m3 = m1.template triangularView<Eigen::Lower>();
66 m3 = m1.template triangularView<Eigen::Lower>();
67 VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(), largerEp
[all...]
H A Dcholesky.cpp35 MatrixType symmLo = symm.template triangularView<Lower>();
39 CholType<MatrixType,Lower> chollo(symmLo);
49 CholType<MatrixType,Lower> chol(symmCpy);
87 SquareMatrixType symmLo = symm.template triangularView<Lower>();
94 LLT<SquareMatrixType,Lower> chollo(symmLo);
129 SquareMatrixType symmLo = symm.template triangularView<Lower>();
131 LDLT<SquareMatrixType,Lower> ldltlo(symmLo);
173 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
174 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
176 m2 -= symmLo.template selfadjointView<Lower>()
[all...]
H A Dtriangular.cpp56 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());
73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps));
74 m3 = m1.template triangularView<Lower>();
78 m3 = m1.template triangularView<Lower>();
79 VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), largerEps));
83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>()
[all...]
H A Dproduct_selfadjoint.cpp42 m2 = m1.template triangularView<Lower>();
43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
56 m2 = m1.template triangularView<Lower>();
57 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
60 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
/external/llvm/include/llvm/Support/
H A DConstantRange.h43 APInt Lower, Upper; member in class:llvm::ConstantRange
55 /// Lower==Upper and Lower != Min or Max value for its type. It will also
57 ConstantRange(const APInt &Lower, const APInt &Upper);
71 const APInt &getLower() const { return Lower; }
79 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
112 if (Upper == Lower + 1)
113 return &Lower;
148 return Lower == CR.Lower
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DRangeConstraintManager.cpp109 const llvm::APSInt &Lower,
123 if (i->To() < Lower) {
130 if (i->Includes(Lower)) {
132 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
136 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
152 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { argument
159 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower);
168 if (Lower < Upper)
172 Lower = Type.getMinValue();
177 Lower
108 IntersectInRange(BasicValueFactory &BV, Factory &F, const llvm::APSInt &Lower, const llvm::APSInt &Upper, PrimRangeSet &newRanges, PrimRangeSet::iterator &i, PrimRangeSet::iterator &e) const argument
241 Intersect(BasicValueFactory &BV, Factory &F, llvm::APSInt Lower, llvm::APSInt Upper) const argument
517 llvm::APSInt Lower = ComparisonVal-Adjustment; local
546 llvm::APSInt Lower = Min-Adjustment; local
[all...]
/external/eigen/Eigen/src/Eigen2Support/
H A DTriangularSolver.h18 const unsigned int LowerTriangularBit = Lower;
21 const unsigned int LowerTriangular = Lower;
/external/icu4c/data/brkitr/
H A Dsent.txt22 $Lower = [\p{Sentence_Break = Lower}];
37 $LowerEx = $Lower ($Extend | $Format)*;
70 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
71 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
H A Dsent_el.txt22 $Lower = [\p{Sentence_Break = Lower}];
37 $LowerEx = $Lower ($Extend | $Format)*;
70 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
71 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
/external/eigen/Eigen/src/Core/products/
H A DGeneralMatrixMatrixTriangular_MKL.h78 IsLower = (UpLo&Lower) == Lower, \
79 LowUp = IsLower ? Lower : Upper, \
103 IsLower = (UpLo&Lower) == Lower, \
104 LowUp = IsLower ? Lower : Upper, \
/external/eigen/lapack/
H A Dcholesky.cpp30 else ret = internal::llt_inplace<Scalar, Lower>::blocked(A);
67 A.triangularView<Lower>().solveInPlace(B);
68 A.triangularView<Lower>().adjoint().solveInPlace(B);

Completed in 241 milliseconds

1234