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

12345

/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/eigen/unsupported/test/
H A Dminres.cpp17 MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_diag;
18 MINRES<SparseMatrix<T>, Lower, IdentityPreconditioner > minres_colmajor_I;
19 // MINRES<SparseMatrix<T>, Lower, IncompleteLUT<T> > minres_colmajor_ilut;
/external/eigen/blas/
H A DRank2Update.h26 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) +=
27 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
28 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) +=
46 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
47 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower
[all...]
H A DPackedSelfadjointProduct.h33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)));
35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]);
36 mat += UpLo==Lower ? size-i : (i+1);
47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
/external/eigen/test/
H A Dsimplicial_cholesky.cpp14 SimplicialCholesky<SparseMatrix<T>, Lower> chol_colmajor_lower_amd;
16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower_amd;
18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower_amd;
20 SimplicialLDLT<SparseMatrix<T>, Lower, NaturalOrdering<int> > ldlt_colmajor_lower_nat;
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 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 Dproduct_syrk.cpp38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
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()));
54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
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());
69 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(),
70 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>()
[all...]
H A Dselfadjoint.cpp34 m3 = m1.template selfadjointView<Lower>();
35 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
41 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
H A Deigensolver_selfadjoint.cpp46 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(
48 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());
51 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(
53 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());
62 VERIFY((symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
63 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));
68 VERIFY((symmB.template selfadjointView<Lower>() * (symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
74 VERIFY((symmA.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGe
[all...]
H A Dproduct_mmtr.cpp38 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint());
40 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint());
43 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint());
45 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint());
48 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint());
50 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint());
H A Dproduct_symm.cpp36 m2 = m1.template triangularView<Lower>();
37 m3 = m2.template selfadjointView<Lower>();
39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
48 m2 = m1.template triangularView<Lower>();
49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
57 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
61 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12;
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<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_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 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...]
/external/llvm/include/llvm/Support/
H A DUnicodeCharRanges.h26 /// \brief Represents a closed range of Unicode code points [Lower, Upper].
28 uint32_t Lower; member in struct:llvm::sys::UnicodeCharRange
33 return Value < Range.Lower;
70 if (I != Ranges.begin() && Prev >= I->Lower) {
74 DEBUG(dbgs().write_hex(I->Lower) << "\n");
77 if (I->Upper < I->Lower) {
79 DEBUG(dbgs().write_hex(I->Lower));
/external/clang/unittests/Basic/
H A DVirtualFileSystemTest.cpp218 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem());
221 new vfs::OverlayFileSystem(Lower));
224 Lower->addDirectory("/lower-only");
228 ErrorOr<vfs::Status> Status1 = Lower->status("/lower-only");
243 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem());
246 new vfs::OverlayFileSystem(Lower));
250 Lower->addDirectory("/both", sys::fs::owner_read);
257 Lower->addRegularFile("/both/foo", sys::fs::owner_read);
379 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem());
382 new vfs::OverlayFileSystem(Lower));
[all...]
/external/llvm/lib/IR/
H A DConstantRange.cpp34 Lower = Upper = APInt::getMaxValue(BitWidth);
36 Lower = Upper = APInt::getMinValue(BitWidth);
42 : Lower(std::move(V)), Upper(Lower + 1) {}
45 : Lower(std::move(L)), Upper(std::move(U)) {
46 assert(Lower.getBitWidth() == Upper.getBitWidth() &&
48 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) &&
49 "Lower
[all...]
/external/llvm/include/llvm/IR/
H A DConstantRange.h43 APInt Lower, Upper; member in class:llvm::ConstantRange
58 /// Lower==Upper and Lower != Min or Max value for its type. It will also
60 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper);
74 const APInt &getLower() const { return Lower; }
82 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
115 if (Upper == Lower + 1)
116 return &Lower;
151 return Lower == CR.Lower
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DRangeConstraintManager.cpp106 const llvm::APSInt &Lower,
120 if (i->To() < Lower) {
127 if (i->Includes(Lower)) {
129 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
133 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
149 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { argument
156 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true);
165 if (Lower < Upper)
169 Lower = Type.getMinValue();
174 Lower
105 IntersectInRange(BasicValueFactory &BV, Factory &F, const llvm::APSInt &Lower, const llvm::APSInt &Upper, PrimRangeSet &newRanges, PrimRangeSet::iterator &i, PrimRangeSet::iterator &e) const argument
238 Intersect(BasicValueFactory &BV, Factory &F, llvm::APSInt Lower, llvm::APSInt Upper) const argument
533 llvm::APSInt Lower = ComparisonVal-Adjustment; local
562 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/icu/icu4c/source/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;

Completed in 331 milliseconds

12345