| /external/eigen/lapack/ |
| zlarfb.f | 286 CALL ZTRMM( 'Right', 'Upper', TRANST, 'Non-unit',
345 CALL ZTRMM( 'Right', 'Upper', TRANS, 'Non-unit',
378 * where V2 is unit upper triangular.
400 CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit',
432 CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose',
463 CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit',
493 CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose',
513 * where V1 is unit upper triangular.
534 CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose',
548 CALL ZTRMM( 'Right', 'Upper', TRANST, 'Non-unit'
[all...] |
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement_test.cc | 101 // lhs_ref is an upper triangular matrix. Construct a full version
112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs);
162 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
|
| schur_eliminator_test.cc | 121 .triangularView<Eigen::Upper>() = R - Q.transpose() * P * Q;
162 .selfadjointView<Eigen::Upper>()
176 Matrix delta = (lhs_ref - lhs_expected).selfadjointView<Eigen::Upper>();
|
| block_jacobi_preconditioner.cc | 98 // .selfadjointView<Eigen::Upper>()
115 block = block.selfadjointView<Eigen::Upper>()
|
| schur_jacobi_preconditioner.cc | 120 .selfadjointView<Eigen::Upper>()
|
| implicit_schur_complement.cc | 160 .selfadjointView<Eigen::Upper>()
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular_MKL.h | 79 LowUp = IsLower ? Lower : Upper, \
104 LowUp = IsLower ? Lower : Upper, \
|
| TriangularSolverVector.h | 23 ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
|
| SelfadjointMatrixVector.h | 185 LhsUpLo = LhsMode&(Upper|Lower)
265 RhsUpLo = RhsMode&(Upper|Lower)
274 SelfadjointProductMatrix<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
|
| /external/llvm/lib/Analysis/ |
| StratifiedSets.h | 611 auto *Upper = &linksAt(UpperIndex);
612 if (Lower == Upper)
618 while (Current->hasAbove() && Current != Upper) {
624 if (Current != Upper)
627 Upper->setAttrs(Attrs);
631 Upper->setBelow(NewBelowIndex);
635 Upper->clearBelow();
639 Ptr->remapTo(Upper->Number);
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 78 template<> struct llt_inplace<EIGTYPE, Upper> \
|
| LLT.h | 26 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
47 * Note that during the decomposition, only the upper triangular part of A is considered. Therefore,
96 /** \returns a view of the upper triangular matrix U */
179 * The strict upper part is not used and even not initialized.
318 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21);
331 template<typename Scalar> struct llt_inplace<Scalar, Upper>
358 typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU;
365 template<typename MatrixType> struct LLT_Traits<MatrixType,Upper>
368 typedef const TriangularView<const MatrixType, Upper> MatrixU;
372 { 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
154 ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
178 eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
200 * is an upper (resp. lower) triangular matrix.
|
| 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)
455 eigen_assert( Mode == Upper || Mode == Lower
458 if((Mode == Upper && row <= col)
483 struct triangular_assignment_selector<Derived1, Derived2, Upper, Dynamic, ClearOpposite>
736 typedef SelfAdjointView<MatrixType, Upper> type;
760 * The parameter \a Mode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper
[all...] |
| /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 | 30 func[UP] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run);
122 func[UP] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run);
173 func[UP] = (internal::packed_rank2_update_selector<Scalar,int,Upper>::run);
228 func[UP] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run);
282 func[UP] = (internal::rank2_update_selector<Scalar,int,Upper>::run);
|
| /external/eigen/test/ |
| cholesky.cpp | 36 MatrixType symmUp = symm.template triangularView<Upper>();
40 CholType<MatrixType,Upper> cholup(symmUp);
86 // to test if really Cholesky only uses the upper triangular part, uncomment the following
91 SquareMatrixType symmUp = symm.template triangularView<Upper>();
101 // test the upper mode
102 LLT<SquareMatrixType,Upper> cholup(symmUp);
143 SquareMatrixType symmUp = symm.template triangularView<Upper>();
153 LDLT<SquareMatrixType,Upper> ldltup(symmUp);
|
| bandmatrix.cpp | 53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
|
| qr_colpivoting.cpp | 35 MatrixType r = qr.matrixQR().template triangularView<Upper>();
60 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 100 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
136 MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
168 T = sqrtT.template triangularView<Upper>();
175 res = res.template triangularView<Upper>() * res;
431 { res.noalias() = U * (T.template triangularView<Upper>() * U.adjoint()); }
439 { res.noalias() = (U * (T.template triangularView<Upper>() * U.adjoint())).real(); }
|
| /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/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 92 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
141 // Browse the nonzero elements of row j of the upper triangular s
179 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
|
| /external/eigen/unsupported/test/ |
| matrix_power.cpp | 22 result.template triangularView<Upper>() = MatrixType::Random(size, size);
35 result.template triangularView<Upper>() = MatrixType::Random(size, size);
|
| /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;
451 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
452 * Upper|Lower can be used to tell both triangular parts can be used as input.
491 // PARDISO supports only upper, row-major matrices
494 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
511 * \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...] |
