/external/eigen/doc/snippets/ |
SelfAdjointView_operatorNorm.cpp | 3 << ones.selfadjointView<Lower>().operatorNorm() << endl;
|
SelfAdjointView_eigenvalues.cpp | 2 VectorXd eivals = ones.selfadjointView<Lower>().eigenvalues();
|
/external/eigen/blas/ |
Rank2Update.h | 26 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 ? i : 0), UpLo==Lower ? size-i : (i+1)) [all...] |
PackedSelfadjointProduct.h | 33 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/ |
conjugate_gradient.cpp | 15 ConjugateGradient<SparseMatrix<T>, Lower > cg_colmajor_lower_diag; 17 ConjugateGradient<SparseMatrix<T>, Lower|Upper> cg_colmajor_loup_diag; 18 ConjugateGradient<SparseMatrix<T>, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
|
simplicial_cholesky.cpp | 14 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;
|
cholmod_support.cpp | 16 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;
|
sparse_permutations.cpp | 33 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); 74 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); 81 res = lo.template selfadjointView<Lower>().twistedBy(p_null); 83 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); 90 res = mat.template selfadjointView<Lower>(); 92 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); 98 res = lo.template selfadjointView<Lower>(); [all...] |
product_syrk.cpp | 38 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>().toDenseMatrix()) [all...] |
selfadjoint.cpp | 34 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>();
|
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<Lower>() * eiSymmGen.eigenvectors())).isApprox [all...] |
product_mmtr.cpp | 38 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());
|
product_symm.cpp | 36 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>() * (s2*rhs3).conjugate()) [all...] |
pardiso_support.cpp | 10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower; 12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower;
|
pastix_support.cpp | 17 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower; 18 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower;
|
product_trmv.cpp | 33 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>(), largerEps)) [all...] |
/external/eigen/unsupported/test/ |
minres.cpp | 17 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_diag; 18 MINRES<SparseMatrix<T>, Lower, IdentityPreconditioner > minres_colmajor_lower_I; 20 // MINRES<SparseMatrix<T>, Lower, IncompleteLUT<T> > minres_colmajor_ilut; 29 MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_lower_diag; 31 MINRES<SparseMatrix<T>, Upper|Lower, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
/external/libchrome/sandbox/linux/services/ |
resource_limits.h | 19 // Lower the soft and hard limit of |resource| to |limit|. If the current 20 // limit is lower than |limit|, keep it. 21 static bool Lower(int resource, rlim_t limit) WARN_UNUSED_RESULT;
|
resource_limits.cc | 15 bool ResourceLimits::Lower(int resource, rlim_t limit) {
|
resource_limits_unittests.cc | 32 SANDBOX_ASSERT(ResourceLimits::Lower(RLIMIT_NPROC, 0));
|
/external/llvm/include/llvm/Support/ |
UnicodeCharRanges.h | 26 /// \brief Represents a closed range of Unicode code points [Lower, Upper]. 28 uint32_t Lower; 33 return Value < Range.Lower; 79 if (I != Ranges.begin() && Prev >= I->Lower) { 82 DEBUG(dbgs() << " should be less than succeeding lower bound 0x"); 83 DEBUG(dbgs().write_hex(I->Lower) << "\n"); 86 if (I->Upper < I->Lower) { 88 DEBUG(dbgs().write_hex(I->Lower)); 89 DEBUG(dbgs() << " should not be less than lower bound 0x");
|
/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())) & [all...] |
/external/llvm/include/llvm/IR/ |
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 44 APInt Lower, Upper; 59 /// Lower==Upper and Lower != Min or Max value for its type. It will also 61 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper); 96 /// Return the lower value for this range. 98 const APInt &getLower() const { return Lower; } 106 uint32_t getBitWidth() const { return Lower.getBitWidth(); } 138 if (Upper == Lower + 1 [all...] |
/external/clang/unittests/Basic/ |
VirtualFileSystemTest.cpp | 234 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); 237 new vfs::OverlayFileSystem(Lower)); 240 Lower->addDirectory("/lower-only"); 244 ErrorOr<vfs::Status> Status1 = Lower->status("/lower-only"); 246 ErrorOr<vfs::Status> Status2 = O->status("/lower-only"); 259 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); 262 new vfs::OverlayFileSystem(Lower)); 266 Lower->addDirectory("/both", sys::fs::owner_read) [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
TriangularSolver.h | 18 const unsigned int LowerTriangularBit = Lower; 21 const unsigned int LowerTriangular = Lower;
|