| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 198 X = L.template triangularView<Upper>().solve(B);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| lmpar.h | 91 /* calculate an upper bound, paru, for the zero of the function. */
202 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
229 /* calculate an upper bound, paru, for the zero of the function. */
|
| /external/eigen/unsupported/test/ |
| matrix_power.cpp | 107 typedef typename internal::conditional<IsComplex, TriangularView<MatrixType,Upper>, const MatrixType&>::type TriangularType;
|
| /external/pdfium/xfa/fxbarcode/oned/ |
| BC_OnedCode39Writer.cpp | 76 ch = Upper(ch);
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 220 if (MatrixType::Flags & Upper)
279 if (MatrixType::Flags & Upper)
501 typedef TriangularView<LUMatrixType, Upper> UMatrixType;
712 int upper; local
742 upper = 1;
757 for (int i = 0; i < upper; ++i)
759 /* upper triangle in the supernode */
769 Lrow[lastl++] = L_SUB(istart + upper - 1);
770 for (int i = upper; i < nsupr; ++i)
779 ++upper;
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| InstructionSimplify.cpp | [all...] |
| /prebuilts/go/darwin-x86/src/unicode/ |
| maketables.go | 517 varDecl = "\tUpper = _Lu; // Upper is the set of Unicode upper case letters.\n"
901 // Is d the same as c, but opposite in upper/lower case? this would make it
911 // matched pair (at least in upper/lower). make the order Upper Lower
915 // for an Upper Lower sequence the deltas have to be in order
937 // for an Upper Lower sequence the deltas have to be in order
952 // for an Upper Lower sequence the deltas have to be in order
980 // as upper case, but have a lower case. Second-guess them.
1077 upper := unicode.ToUpper(i
[all...] |
| /prebuilts/go/linux-x86/src/unicode/ |
| maketables.go | 517 varDecl = "\tUpper = _Lu; // Upper is the set of Unicode upper case letters.\n"
901 // Is d the same as c, but opposite in upper/lower case? this would make it
911 // matched pair (at least in upper/lower). make the order Upper Lower
915 // for an Upper Lower sequence the deltas have to be in order
937 // for an Upper Lower sequence the deltas have to be in order
952 // for an Upper Lower sequence the deltas have to be in order
980 // as upper case, but have a lower case. Second-guess them.
1077 upper := unicode.ToUpper(i
[all...] |
| /external/eigen/test/ |
| sparse_basic.cpp | 434 refMat3 = refMat2.template triangularView<Upper>();
435 m3 = m2.template triangularView<Upper>();
482 VERIFY_RAISES_ASSERT(m4.template selfadjointView<Upper>());
|
| lu.cpp | 74 u = lu.matrixLU().template triangularView<Upper>();
|
| sparse_solver.h | 229 if(Solver::UpLo==(Lower|Upper))
329 if(Solver::UpLo == (Lower|Upper))
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 125 if(UpLo==Upper) res.stype = 1;
423 * or Upper. Default is Lower.
427 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
474 * or Upper. Default is Lower.
478 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
523 * or Upper. Default is Lower.
527 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
574 * or Upper. Default is Lower.
578 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteCholesky.h | 26 * or Upper. Default is Lower.
162 x = m_L.adjoint().template triangularView<Upper>().solve(x);
|
| IncompleteLUT.h | 175 x = m_lu.template triangularView<Upper>().solve(x);
290 // 1 - copy the lower and the upper part of the row i of mat in the working vector u
292 Index sizeu = 1; // number of nonzero elements in the upper part of the current row
317 // copy the upper part
381 if (j >= ii) // dealing with the upper part
408 // reset the upper part of the pointer jr to zero
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 39 * upper triangular matrix.
197 * Only the upper triangular part should be referenced. To get it, use
198 * \code matrixR().template triangularView<Upper>() \endcode
201 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
606 .template triangularView<Upper>()
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 117 // pre: T is quasi-upper-triangular and sqrtT is a zero matrix of the same size
137 // pre: T is quasi-upper-triangular and diagonal blocks of sqrtT are square root of diagonal blocks of T.
173 * \param[out] result matrix square root of upper Hessenberg part of \p arg.
175 * This function computes the square root of the upper quasi-triangular matrix stored in the upper
176 * Hessenberg part of \p arg. Only the upper Hessenberg part of \p result is updated, the rest is
198 * \param[out] result matrix square root of upper triangular part of \p arg.
200 * Only the upper triangular part (including the diagonal) of \p result is updated, the rest is not
214 // Compute square root of arg and store it in upper triangular part of result
299 result = U * (sqrtT.template triangularView<Upper>() * U.adjoint())
[all...] |
| MatrixFunction.h | 43 * \param[in] A argument of matrix function, should be upper triangular and atomic
59 N.template triangularView<Upper>().solveInPlace(e);
66 // TODO: Use that A is upper triangular
76 for (Index s = 1; s < 1.1 * rows + 10; s++) { // upper limit is fairly arbitrary
243 * upper triangular), with the blocking given by \p blockStart and \p clusterSize. The matrix function of
258 * \param[in] A the matrix A; should be square and upper triangular
259 * \param[in] B the matrix B; should be square and upper triangular
326 * the diagonal is zero, because \p T is upper triangular.
463 result = U * (fT.template triangularView<Upper>() * U.adjoint());
|
| /external/llvm/include/llvm/Analysis/ |
| DependenceAnalysis.h | 369 const SCEV *Upper[8];
574 /// If no upper bound is available, return NULL.
[all...] |
| /external/eigen/lapack/ |
| clarft.f | 40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
253 CALL CTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
|
| dlarft.f | 40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
251 CALL DTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
|
| slarft.f | 40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
251 CALL STRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
|
| zlarft.f | 40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
252 CALL ZTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T,
|
| /prebuilts/go/darwin-x86/src/encoding/gob/ |
| decoder.go | 16 // Upper limit of 1GB, allowing room to grow a little without overflow.
|
| /prebuilts/go/linux-x86/src/encoding/gob/ |
| decoder.go | 16 // Upper limit of 1GB, allowing room to grow a little without overflow.
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector.h | 192 internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),
|
