Searched refs:UpLo (Results 1 - 25 of 27) sorted by relevance

12

/external/eigen/blas/
H A DPackedSelfadjointProduct.h18 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
21 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
22 struct selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)));
35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]);
36 mat += UpLo==Lower ? size-i : (i+1);
41 template<typename Scalar, typename Index, int UpLo, boo
[all...]
H A DRank2Update.h18 template<typename Scalar, typename Index, int UpLo>
26 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) +=
27 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
28 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
36 template<typename Scalar, typename Index, int UpLo>
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) +=
46 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo
[all...]
/external/eigen/Eigen/src/Eigenvalues/
H A DMatrixBaseEigenvalues.h87 template<typename MatrixType, unsigned int UpLo>
88 inline typename SelfAdjointView<MatrixType, UpLo>::EigenvaluesReturnType
89 SelfAdjointView<MatrixType, UpLo>::eigenvalues() const
91 typedef typename SelfAdjointView<MatrixType, UpLo>::PlainObject PlainObject;
151 template<typename MatrixType, unsigned int UpLo>
152 inline typename SelfAdjointView<MatrixType, UpLo>::RealScalar
153 SelfAdjointView<MatrixType, UpLo>::operatorNorm() const
/external/eigen/Eigen/src/Core/products/
H A DSelfadjointMatrixVector_MKL.h46 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs>
48 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn> {};
51 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> \
52 struct selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Specialized> { \
60 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn>::run( \
63 selfadjoint_matrix_vector_product_symv<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs>::run( \
75 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> \
76 struct selfadjoint_matrix_vector_product_symv<EIGTYPE,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs> \
86 IsLower = UpLo == Lower ? 1 : 0 \
H A DSelfadjointProduct.h22 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
23 struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1)))
33 += (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1)));
38 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
39 struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs>
43 selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vecY,vecX,alpha);
47 template<typename MatrixType, typename OtherType, int UpLo, boo
[all...]
H A DGeneralMatrixMatrixTriangular_MKL.h40 template <typename Index, typename Scalar, int AStorageOrder, bool ConjugateA, int ResStorageOrder, int UpLo>
43 Index,Scalar,AStorageOrder,ConjugateA,Scalar,AStorageOrder,ConjugateA,ResStorageOrder,UpLo,BuiltIn> {};
49 int RhsStorageOrder, bool ConjugateRhs, int UpLo> \
51 Scalar,RhsStorageOrder,ConjugateRhs,ColMajor,UpLo,Specialized> { \
56 general_matrix_matrix_rankupdate<Index,Scalar,LhsStorageOrder,ConjugateLhs,ColMajor,UpLo> \
62 ColMajor, UpLo, BuiltIn> \
75 template <typename Index, int AStorageOrder, bool ConjugateA, int UpLo> \
76 struct general_matrix_matrix_rankupdate<Index,EIGTYPE,AStorageOrder,ConjugateA,ColMajor,UpLo> { \
78 IsLower = (UpLo&Lower) == Lower, \
100 template <typename Index, int AStorageOrder, bool ConjugateA, int UpLo> \
[all...]
H A DGeneralMatrixMatrixTriangular.h15 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
28 template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo>
35 int ResStorageOrder, int UpLo, int Version = Specialized>
40 typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version>
41 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor,UpLo,Version>
50 ColMajor, UpLo==Lower?Upper:Lower>
56 typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version>
57 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,ColMajor,UpLo,Version>
85 tribb_kernel<LhsScalar, RhsScalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs, UpLo> sybb;
104 if (UpLo
[all...]
H A DSelfadjointRank2Update.h21 template<typename Scalar, typename Index, typename UType, typename VType, int UpLo>
58 template<typename MatrixType, unsigned int UpLo>
60 SelfAdjointView<MatrixType,UpLo>& SelfAdjointView<MatrixType,UpLo>
85 (IsRowMajor ? int(UpLo==Upper ? Lower : Upper) : UpLo)>
H A DSelfadjointMatrixVector.h23 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version=Specialized>
26 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version>
38 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version>
39 EIGEN_DONT_INLINE void selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Version>::run(
51 IsLower = UpLo == Lower ? 1 : 0,
/external/eigen/Eigen/src/SparseCore/
H A DSparseSelfAdjointView.h21 * \param UpLo can be either \c #Lower or \c #Upper
29 template<typename Lhs, typename Rhs, int UpLo>
32 template<typename Lhs, typename Rhs, int UpLo>
37 template<typename MatrixType, unsigned int UpLo>
38 struct traits<SparseSelfAdjointView<MatrixType,UpLo> > : traits<MatrixType> {
44 template<int UpLo,typename MatrixType,int DestOrder>
49 template<typename MatrixType, unsigned int UpLo> class SparseSelfAdjointView
50 : public EigenBase<SparseSelfAdjointView<MatrixType,UpLo> >
98 SparseSelfAdjointTimeDenseProduct<MatrixType,OtherDerived,UpLo>
101 return SparseSelfAdjointTimeDenseProduct<MatrixType,OtherDerived,UpLo>(m_matri
[all...]
H A DTriangularSolver.h18 int UpLo = (Mode & Lower)
198 int UpLo = (Mode & Lower)
207 template<typename Lhs, typename Rhs, int Mode, int UpLo>
208 struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
215 const bool IsLower = (UpLo==Lower);
H A DSparseMatrixBase.h386 template<unsigned int UpLo> inline const SparseSelfAdjointView<Derived, UpLo> selfadjointView() const;
387 template<unsigned int UpLo> inline SparseSelfAdjointView<Derived, UpLo> selfadjointView();
H A DSparseUtil.h77 template<typename MatrixType, unsigned int UpLo> class SparseSelfAdjointView;
91 template<typename MatrixType,int UpLo> class SparseSymmetricPermutationProduct;
/external/eigen/Eigen/src/Core/
H A DSelfAdjointView.h32 template<typename MatrixType, unsigned int UpLo>
33 struct traits<SelfAdjointView<MatrixType, UpLo> > : traits<MatrixType>
40 Mode = UpLo | SelfAdjoint,
53 template<typename MatrixType, unsigned int UpLo> class SelfAdjointView
54 : public TriangularBase<SelfAdjointView<MatrixType, UpLo> >
152 const LLT<PlainObject, UpLo> llt() const;
153 const LDLT<PlainObject, UpLo> ldlt() const;
170 OtherPart = UpLo == Upper ? StrictlyLower : StrictlyUpper
172 m_matrix.const_cast_derived().template triangularView<UpLo>() = other;
180 OtherPart = UpLo
[all...]
H A DMatrixBase.h254 template<unsigned int UpLo> struct SelfAdjointViewReturnType { typedef SelfAdjointView<Derived, UpLo> Type; };
255 template<unsigned int UpLo> struct ConstSelfAdjointViewReturnType { typedef const SelfAdjointView<const Derived, UpLo> Type; };
257 template<unsigned int UpLo> typename SelfAdjointViewReturnType<UpLo>::Type selfadjointView();
258 template<unsigned int UpLo> typename ConstSelfAdjointViewReturnType<UpLo>::Type selfadjointView() const;
/external/eigen/Eigen/src/Cholesky/
H A DLLT.h16 template<typename MatrixType, int UpLo> struct LLT_Traits;
26 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
67 UpLo = _UpLo enumerator in enum:Eigen::LLT::__anon20489
70 typedef internal::LLT_Traits<MatrixType,UpLo> Traits;
188 template<typename Scalar, int UpLo> struct llt_inplace;
411 if(internal::llt_inplace<typename MatrixType::Scalar, UpLo>::rankUpdate(m_matrix,v,sigma)>=0)
420 template<typename _MatrixType, int UpLo, typename Rhs>
421 struct solve_retval<LLT<_MatrixType, UpLo>, Rhs>
422 : solve_retval_base<LLT<_MatrixType, UpLo>, Rhs>
424 typedef LLT<_MatrixType,UpLo> LLTTyp
[all...]
H A DLDLT.h19 template<typename MatrixType, int UpLo> struct LDLT_Traits;
32 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
58 UpLo = _UpLo enumerator in enum:Eigen::LDLT::__anon20487
68 typedef internal::LDLT_Traits<MatrixType,UpLo> Traits;
254 template<int UpLo> struct ldlt_inplace;
446 internal::ldlt_inplace<UpLo>::unblocked(m_matrix, m_transpositions, m_temporary, m_sign);
478 internal::ldlt_inplace<UpLo>::update(m_matrix, m_transpositions, m_temporary, w, sigma);
585 template<typename MatrixType, unsigned int UpLo>
586 inline const LDLT<typename SelfAdjointView<MatrixType, UpLo>::PlainObject, UpLo>
[all...]
/external/eigen/Eigen/src/SparseCholesky/
H A DSimplicialCholesky.h41 enum { UpLo = internal::traits<Derived>::UpLo }; enumerator in enum:Eigen::SimplicialCholeskyBase::__anon20952
201 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
254 enum { UpLo = _UpLo }; enumerator in enum:Eigen::internal::traits::__anon20953
268 enum { UpLo = _UpLo }; enumerator in enum:Eigen::internal::traits::__anon20954
282 enum { UpLo = _UpLo }; enumerator in enum:Eigen::internal::traits::__anon20955
310 enum { UpLo = _UpLo }; enumerator in enum:Eigen::SimplicialLLT::__anon20956
399 enum { UpLo = _UpLo }; enumerator in enum:Eigen::SimplicialLDLT::__anon20957
481 enum { UpLo = _UpLo }; enumerator in enum:Eigen::SimplicialCholesky::__anon20958
489 typedef internal::traits<SimplicialLDLT<MatrixType,UpLo> > LDLTTrait
[all...]
/external/eigen/Eigen/src/CholmodSupport/
H A DCholmodSupport.h107 template<typename _Scalar, int _Options, typename _Index, unsigned int UpLo>
108 cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<SparseMatrix<_Scalar,_Options,_Index>, UpLo>& mat)
112 if(UpLo==Upper) res.stype = 1;
113 if(UpLo==Lower) res.stype = -1;
164 enum { UpLo = _UpLo }; enumerator in enum:Eigen::CholmodBase::__anon20490
260 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
278 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DConjugateGradient.h174 UpLo = _UpLo enumerator in enum:Eigen::ConjugateGradient::__anon20922
225 internal::conjugate_gradient(mp_matrix->template selfadjointView<UpLo>(), b.col(j), xj,
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DMINRES.h211 enum {UpLo = _UpLo}; enumerator in enum:Eigen::MINRES::__anon21071
262 internal::minres(mp_matrix->template selfadjointView<UpLo>(), b.col(j), xj,
H A DIncompleteCholesky.h41 enum { UpLo = _UpLo }; enumerator in enum:Eigen::IncompleteCholesky::__anon21070
77 ord(mat.template selfadjointView<UpLo>(), m_perm);
/external/eigen/Eigen/src/PaStiXSupport/
H A DPaStiXSupport.h536 * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX
549 enum { UpLo = _UpLo }; enumerator in enum:Eigen::PastixLLT::__anon20937
602 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>();
617 * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX
630 enum { UpLo = _UpLo }; enumerator in enum:Eigen::PastixLDLT::__anon20938
684 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>();
/external/eigen/Eigen/src/PardisoSupport/
H A DPardisoSupport.h451 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
470 enum { UpLo = _UpLo };
494 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
533 enum { UpLo = Options&(Upper|Lower) };
553 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
/external/eigen/test/
H A Dsparse_solver.h148 halfA.template selfadjointView<Solver::UpLo>().rankUpdate(M);
217 halfA.template selfadjointView<Solver::UpLo>() = it.matrix().template triangularView<Eigen::Lower>().twistedBy(pnull);

Completed in 2381 milliseconds

12