| /external/ceres-solver/internal/ceres/ |
| schur_jacobi_preconditioner.cc | 130 .selfadjointView<Eigen::Upper>()
|
| implicit_schur_complement.cc | 163 .selfadjointView<Eigen::Upper>()
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixVector.h | 178 LhsUpLo = LhsMode&(Upper|Lower)
258 RhsUpLo = RhsMode&(Upper|Lower)
267 SelfadjointProductMatrix<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
|
| GeneralMatrixMatrixTriangular.h | 47 ColMajor, UpLo==Lower?Upper:Lower>
107 if (UpLo==Upper)
148 if(UpLo==Upper)
|
| SelfadjointMatrixMatrix.h | 380 LhsIsUpper = (LhsMode&(Upper|Lower))==Upper,
382 RhsIsUpper = (RhsMode&(Upper|Lower))==Upper,
|
| TriangularMatrixVector_MKL.h | 82 LowUp = IsLower ? Lower : Upper \
167 LowUp = IsLower ? Lower : Upper \
|
| TriangularMatrixMatrix_MKL.h | 90 LowUp = IsLower ? Lower : Upper, \
204 LowUp = IsLower ? Lower : Upper, \
|
| /external/eigen/test/ |
| bandmatrix.cpp | 53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
|
| qr_colpivoting.cpp | 37 MatrixType r = qr.matrixQR().template triangularView<Upper>();
62 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 77 x = m_lu.template triangularView<Upper>().solve(x);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
|
| /external/eigen/blas/ |
| level2_real_impl.h | 44 if(UPLO(*uplo)==UP) vector(actual_y,*n).noalias() += matrix(a,*n,*n,*lda).selfadjointView<Upper>() * (alpha * vector(actual_x,*n));
93 // else if(UPLO(*uplo)==UP) matrix(c,*n,*n,*ldc).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), alpha);
147 else if(UPLO(*uplo)==UP) matrix(c,*n,*n,*ldc).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), vector(y_cpy,*n), alpha);
|
| level2_cplx_impl.h | 52 if(UPLO(*uplo)==UP) vector(actual_y,*n).noalias() += matrix(a,*n,*n,*lda).selfadjointView<Upper>() * (alpha * vector(actual_x,*n));
139 // else if(UPLO(*uplo)==UP) matrix(a,*n,*n,*lda).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), alpha);
186 else if(UPLO(*uplo)==UP) matrix(a,*n,*n,*lda).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n),vector(y_cpy,*n),alpha);
|
| /external/clang/lib/Lex/ |
| UnicodeCharSets.h | 23 uint32_t Upper;
53 DEBUG(llvm::dbgs() << "Upper bound 0x");
59 if (I->Upper < I->Lower) {
60 DEBUG(llvm::dbgs() << "Upper bound 0x");
63 DEBUG(llvm::dbgs().write_hex(I->Upper) << "\n");
66 Prev = I->Upper;
92 else if (C > CharSet[MidPoint].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;
473 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
474 * Upper|Lower can be used to tell both triangular parts can be used as input.
513 // PARDISO supports only upper, row-major matrices
516 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
533 * \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/Eigen/src/Core/ |
| TriangularMatrix.h | 102 eigen_assert((mode==Upper && col>=row)
125 * \param Mode the kind of triangular matrix expression to construct. Can be #Upper,
127 * This is in fact a bit field; it must have either #Upper or #Lower,
186 TransposeMode = (Mode & Upper ? Lower : 0)
187 | (Mode & Lower ? Upper : 0)
446 eigen_assert( Mode == Upper || Mode == Lower
449 if((Mode == Upper && row <= col)
474 struct triangular_assignment_selector<Derived1, Derived2, Upper, Dynamic, ClearOpposite>
726 typedef SelfAdjointView<MatrixType, Upper> type;
750 * The parameter \a Mode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 28 || ((Mode&Upper) && (MatrixType::Flags&RowMajorBit)),
|
| SparseMatrixBase.h | 361 SparseSymmetricPermutationProduct<Derived,Upper|Lower> twistedBy(const PermutationMatrix<Dynamic,Dynamic,Index>& perm) const
363 return SparseSymmetricPermutationProduct<Derived,Upper|Lower>(derived(), perm);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunctionAtomic.h | 40 * \param[in] A argument of matrix function, should be upper triangular and atomic
73 // TODO: Use that A is upper triangular
81 for (Index s = 1; s < 1.1 * m_Arows + 10; s++) { // upper limit is fairly arbitrary
99 N.template triangularView<Upper>().solveInPlace(e);
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 91 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
136 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
172 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
226 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
268 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
321 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 893 SDValue Upper = CurDAG->getConstant(UpperVal, VT);
895 Upper = CurDAG->getNode(Opcode, DL, VT, Op0, Upper);
896 Upper = SDValue(Select(Upper.getNode()), 0);
899 SDValue Or = CurDAG->getNode(Opcode, DL, VT, Upper, Lower);
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 922 // This routine collects upper bound and extends if needed.
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 24 * is decomposed as A = PLUQ where L is unit-lower-triangular, U is upper-triangular, and P and Q
97 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
523 .template triangularView<Upper>().toDenseMatrix();
570 * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end.
605 .template triangularView<Upper>().solveInPlace(
706 .template triangularView<Upper>()
|
| PartialPivLU.h | 25 * is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P
94 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
422 * m_lu.template triangularView<Upper>();
458 dec().matrixLU().template triangularView<Upper>().solveInPlace(dst);
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 30 * upper triangular matrix.
480 .template triangularView<Upper>()
488 .template triangularView<Upper>()
|
