| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 29 || ((Mode&Upper) && (MatrixType::Flags&RowMajorBit)),
81 || ((Mode&Upper) && (ArgType::Flags&RowMajorBit)),
|
| /external/eigen/doc/examples/ |
| matrixfree_cg.cpp | 95 Eigen::ConjugateGradient<MatrixReplacement, Eigen::Lower|Eigen::Upper, Eigen::IdentityPreconditioner> cg;
123 Eigen::MINRES<MatrixReplacement, Eigen::Lower|Eigen::Upper, Eigen::IdentityPreconditioner> minres;
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MatrixMarketIterator.h | 93 RealScalar upper_norm = m_mat.template triangularView<Upper>().norm();
102 // only the upper part is stored
104 m_mat = tmp.template selfadjointView<Upper>();
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/DebugInfo/CodeView/ |
| TypeHashing.h | 191 write_hex(Stream, V.Hash, HexPrintStyle::Upper, 8);
200 write_hex(Stream, B, HexPrintStyle::Upper, 2);
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_LAPACKE.h | 75 template<> struct llt_inplace<EIGTYPE, Upper> \
|
| LLT.h | 26 * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
49 * Note that during the decomposition, only the upper triangular part of A is considered. Therefore,
114 /** \returns a view of the upper triangular matrix U */
216 * The strict upper part is not used and even not initialized.
353 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21);
366 template<typename Scalar> struct llt_inplace<Scalar, Upper>
393 typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU;
400 template<typename MatrixType> struct LLT_Traits<MatrixType,Upper>
403 typedef const TriangularView<const MatrixType, Upper> MatrixU;
407 { return llt_inplace<typename MatrixType::Scalar, Upper>::blocked(m)==-1;
[all...] |
| /external/eigen/Eigen/src/Core/ |
| SolveTriangular.h | 43 int Mode, // can be Upper/Lower | UnitDiag
153 ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
171 eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
|
| /external/eigen/blas/ |
| PackedSelfadjointProduct.h | 47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
|
| level2_cplx_impl.h | 25 (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run),
110 (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run),
154 (internal::packed_rank2_update_selector<Scalar,int,Upper>::run),
202 (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run),
249 (internal::rank2_update_selector<Scalar,int,Upper>::run),
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 81 x = m_lu.template triangularView<Upper>().solve(x);
|
| MINRES.h | 169 * Upper, or Lower|Upper in which the full matrix entries will be considered. Default is Lower.
246 && (UpLo==(Lower|Upper))
251 EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(MatrixWrapper::MatrixFree,UpLo==(Lower|Upper)),MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY);
252 typedef typename internal::conditional<UpLo==(Lower|Upper),
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular_BLAS.h | 55 if ( lhs==rhs && ((UpLo&(Lower|Upper)==UpLo)) ) { \
80 LowUp = IsLower ? Lower : Upper, \
101 LowUp = IsLower ? Lower : Upper, \
|
| TriangularSolverVector.h | 23 ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
|
| GeneralMatrixMatrixTriangular.h | 51 ColMajor, UpLo==Lower?Upper:Lower>
116 if (UpLo==Upper)
160 if(UpLo==Upper)
289 IsRowMajor ? RowMajor : ColMajor, UpLo&(Lower|Upper)>
292 &actualRhs.coeffRef(0,SkipDiag&&(UpLo&Upper)==Upper ? 1 : 0), actualRhs.outerStride(),
|
| SelfadjointMatrixVector.h | 175 enum { LhsUpLo = LhsMode&(Upper|Lower) };
244 enum { RhsUpLo = RhsMode&(Upper|Lower) };
251 selfadjoint_product_impl<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 117 * \c Upper, or \c Lower|Upper in which the full matrix entries will be considered.
118 * Default is \c Lower, best performance is \c Lower|Upper.
130 * achieved when using a complete matrix and \b Lower|Upper as the \a _UpLo template parameter. Moreover, in this
140 ConjugateGradient<SparseMatrix<double>, Lower|Upper> cg;
203 && (UpLo==(Lower|Upper))
208 EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(MatrixWrapper::MatrixFree,UpLo==(Lower|Upper)),MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY);
209 typedef typename internal::conditional<UpLo==(Lower|Upper),
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Support/ |
| NativeFormatTests.cpp | 77 // upper-case, prefix.
88 // upper-case, no prefix.
89 EXPECT_EQ("0", format_number(0, HexPrintStyle::Upper));
90 EXPECT_EQ("BEEF", format_number(0xbeef, HexPrintStyle::Upper));
91 EXPECT_EQ("DEADBEEF", format_number(0xdeadbeef, HexPrintStyle::Upper));
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 38 template<typename _MatrixType, int Options=Upper> class PardisoLLT;
39 template<typename _MatrixType, int Options=Upper> class PardisoLDLT;
431 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
432 * Upper|Lower can be used to tell both triangular parts can be used as input.
472 // PARDISO supports only upper, row-major matrices
475 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
493 * \tparam Options can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 121 * (or destroyed) before evaluation. Only the upper triangular
168 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
204 MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
223 T = sqrtT.template triangularView<Upper>();
230 res = res.template triangularView<Upper>() * res;
561 m_fT.topRightCorner(m_rank, m_nulls) = m_T.topLeftCorner(m_rank, m_rank).template triangularView<Upper>()
574 { res.noalias() = U * (T.template triangularView<Upper>() * U.adjoint()); }
582 { res.noalias() = (U * (T.template triangularView<Upper>() * U.adjoint())).real(); }
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 213 if(m_P.size()==0 && (UpLo&Upper)==Upper)
220 tmp.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
281 typedef TriangularView<const typename CholMatrixType::AdjointReturnType, Eigen::Upper> MatrixU;
322 * or Upper. Default is Lower.
413 * or Upper. Default is Lower.
670 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
678 // we have to transpose the lower part to to the upper one
680 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>();
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
| raw_ostream.cpp | 363 if (FN.Upper && FN.HexPrefix)
365 else if (FN.Upper && !FN.HexPrefix)
366 Style = HexPrintStyle::Upper;
367 else if (!FN.Upper && FN.HexPrefix)
390 HexPrintStyle HPS = FB.Upper ? HexPrintStyle::Upper : HexPrintStyle::Lower;
|
| NativeFormatting.cpp | 143 bool Upper =
144 (Style == HexPrintStyle::Upper || Style == HexPrintStyle::PrefixUpper);
157 *--CurPtr = hexdigit(x, !Upper);
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| raw_ostream.cpp | 342 if (FN.Upper && FN.HexPrefix)
344 else if (FN.Upper && !FN.HexPrefix)
345 Style = HexPrintStyle::Upper;
346 else if (!FN.Upper && FN.HexPrefix)
369 HexPrintStyle HPS = FB.Upper ? HexPrintStyle::Upper : HexPrintStyle::Lower;
|
| NativeFormatting.cpp | 143 bool Upper =
144 (Style == HexPrintStyle::Upper || Style == HexPrintStyle::PrefixUpper);
157 *--CurPtr = hexdigit(x, !Upper);
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 51 * is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P
135 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
243 m_lu.template triangularView<Upper>().solveInPlace(dst);
260 dst = m_lu.template triangularView<Upper>().adjoint().solve(rhs);
265 dst = m_lu.template triangularView<Upper>().transpose().solve(rhs);
554 * m_lu.template triangularView<Upper>();
|
