| /external/eigen/test/ |
| conjugate_gradient.cpp | 16 ConjugateGradient<SparseMatrix<T>, Upper > cg_colmajor_upper_diag;
17 ConjugateGradient<SparseMatrix<T>, Lower|Upper> cg_colmajor_loup_diag;
19 ConjugateGradient<SparseMatrix<T>, Upper, IdentityPreconditioner> cg_colmajor_upper_I;
|
| simplicial_cholesky.cpp | 15 SimplicialCholesky<SparseMatrix<T>, Upper> chol_colmajor_upper_amd;
17 SimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper_amd;
19 SimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper_amd;
21 SimplicialLDLT<SparseMatrix<T>, Upper, NaturalOrdering<int> > ldlt_colmajor_upper_nat;
|
| cholmod_support.cpp | 17 CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(CholmodSupernodalLLt);
19 CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(CholmodSimplicialLLt);
21 CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(CholmodLDLt);
24 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper;
26 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper;
28 CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper;
|
| sparse_permutations.cpp | 32 up = mat.template triangularView<Upper>();
35 up_sym_d = mat_d.template selfadjointView<Upper>();
39 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>()));
68 res = mat.template selfadjointView<Upper>().twistedBy(p_null);
70 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
77 res = up.template selfadjointView<Upper>().twistedBy(p_null);
79 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");
86 res = mat.template selfadjointView<Upper>();
88 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
94 res = up.template selfadjointView<Upper>();
[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...] |
| 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...] |
| product_mmtr.cpp | 39 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint()));
41 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint()));
44 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose()));
46 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint()));
49 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate()));
51 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint()));
|
| pardiso_support.cpp | 11 PardisoLLT < SparseMatrix<T, RowMajor>, Upper> pardiso_llt_upper;
13 PardisoLDLT < SparseMatrix<T, RowMajor>, Upper> pardiso_ldlt_upper;
|
| pastix_support.cpp | 19 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_llt_upper;
20 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_ldlt_upper;
|
| selfadjoint.cpp | 29 m3 = m1.template selfadjointView<Upper>();
30 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>()));
|
| sparse_solvers.cpp | 56 // upper - dense
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));
75 // upper - transpos
[all...] |
| product_selfadjoint.cpp | 45 m2 = m1.template triangularView<Upper>();
46 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
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>();
50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
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());
|
| nomalloc.cpp | 68 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0);
69 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0);
70 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint();
71 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint();
73 m2.row(0).noalias() = m1.row(0) * m1.template triangularView<Upper>();
74 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>();
75 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template triangularView<Upper>();
76 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template triangularView<Upper>();
79 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0);
80 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0)
[all...] |
| /external/eigen/doc/snippets/ |
| Tutorial_solve_triangular_inplace.cpp | 5 A.triangularView<Upper>().solveInPlace(b);
|
| Tutorial_solve_triangular.cpp | 7 Vector3f x = A.triangularView<Upper>().solve(b);
|
| /external/eigen/unsupported/test/ |
| minres.cpp | 17 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_diag;
19 MINRES<SparseMatrix<T>, Upper, IdentityPreconditioner > minres_colmajor_upper_I;
30 MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_upper_diag;
31 MINRES<SparseMatrix<T>, Upper|Lower, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
| /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!");
184 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;
|
| Format.h | 147 bool Upper;
154 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U),
165 bool Upper = false) {
167 return FormattedNumber(N, 0, Width, true, Upper, true);
178 bool Upper = false) {
180 return FormattedNumber(N, 0, Width, true, Upper, false);
|
| /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/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);
100 /// Return the upper value for this range.
102 const APInt &getUpper() const { return Upper; }
138 if (Upper == Lower + 1)
170 return Lower == CR.Lower && Upper == CR.Upper;
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| TriangularSolver.h | 17 const unsigned int UpperTriangularBit = Upper;
20 const unsigned int UpperTriangular = Upper;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 116 const llvm::APSInt &Upper,
132 if (i->From() > Upper) {
137 if (i->Includes(Upper)) {
139 BV.getValue(Upper)));
144 if (i->Includes(Upper)) {
145 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
160 // both the upper and lower bounds against the symbol's type.
166 APSIntType::RangeTestResultKind UpperTest = Type.testInRange(Upper, true);
174 if (Lower < Upper)
[all...] |
| /external/eigen/lapack/ |
| cholesky.cpp | 29 if(UPLO(*uplo)==UP) ret = int(internal::llt_inplace<Scalar, Upper>::blocked(A));
62 A.triangularView<Upper>().adjoint().solveInPlace(B);
63 A.triangularView<Upper>().solveInPlace(B);
|
