| /external/eigen/Eigen/src/Eigenvalues/ |
| MatrixBaseEigenvalues.h | 87 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;
150 template<typename MatrixType, unsigned int UpLo>
151 inline typename SelfAdjointView<MatrixType, UpLo>::RealScalar
152 SelfAdjointView<MatrixType, UpLo>::operatorNorm() const
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 21 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
24 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
25 struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
34 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1)))
35 += (alpha * cj(vec[i])) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1)));
40 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
41 struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs>
45 selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vec,alpha)
[all...] |
| SelfadjointMatrixVector_MKL.h | 46 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 \
91 char uplo=(IsRowMajor) ? (IsLower ? 'U' : 'L') : (IsLower ? 'L' : 'U');
[all...] |
| GeneralMatrixMatrixTriangular_MKL.h | 40 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, \
88 char uplo=(IsLower) ? 'L' : 'U', trans=(AStorageOrder==RowMajor) ? 'T':'N';
[all...] |
| GeneralMatrixMatrixTriangular.h | 25 template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo>
32 int ResStorageOrder, int UpLo, int Version = Specialized>
37 typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version>
38 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor,UpLo,Version>
47 ColMajor, UpLo==Lower?Upper:Lower>
53 typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version>
54 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,ColMajor,UpLo,Version>
82 tribb_kernel<LhsScalar, RhsScalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs, UpLo> sybb;
101 if (UpLo==Lower)
107 if (UpLo==Upper
[all...] |
| SelfadjointRank2Update.h | 21 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)>
|
| SelfadjointMatrixVector.h | 23 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>
43 IsLower = UpLo == Lower ? 1 : 0,
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSelfAdjointView.h | 21 * \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> >
74 SparseSelfAdjointTimeDenseProduct<MatrixType,OtherDerived,UpLo>
77 return SparseSelfAdjointTimeDenseProduct<MatrixType,OtherDerived,UpLo>(m_matrix, rhs.derived())
[all...] |
| TriangularSolver.h | 18 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);
|
| SparseMatrixBase.h | 383 template<unsigned int UpLo> inline const SparseSelfAdjointView<Derived, UpLo> selfadjointView() const;
384 template<unsigned int UpLo> inline SparseSelfAdjointView<Derived, UpLo> selfadjointView();
|
| SparseUtil.h | 78 template<typename MatrixType, unsigned int UpLo> class SparseSelfAdjointView;
90 template<typename MatrixType,int UpLo> class SparseSymmetricPermutationProduct;
|
| /external/eigen/Eigen/src/Core/ |
| SelfAdjointView.h | 32 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 == Upper ? StrictlyLower : StrictlyUppe
[all...] |
| MatrixBase.h | 251 template<unsigned int UpLo> struct SelfAdjointViewReturnType { typedef SelfAdjointView<Derived, UpLo> Type; };
252 template<unsigned int UpLo> struct ConstSelfAdjointViewReturnType { typedef const SelfAdjointView<const Derived, UpLo> Type; };
254 template<unsigned int UpLo> typename SelfAdjointViewReturnType<UpLo>::Type selfadjointView();
255 template<unsigned int UpLo> typename ConstSelfAdjointViewReturnType<UpLo>::Type selfadjointView() const;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 16 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
70 typedef internal::LLT_Traits<MatrixType,UpLo> Traits;
188 template<typename Scalar, int UpLo> struct llt_inplace;
409 if(internal::llt_inplace<typename MatrixType::Scalar, UpLo>::rankUpdate(m_matrix,v,sigma)>=0)
418 template<typename _MatrixType, int UpLo, typename Rhs>
419 struct solve_retval<LLT<_MatrixType, UpLo>, Rhs>
420 : solve_retval_base<LLT<_MatrixType, UpLo>, Rhs>
422 typedef LLT<_MatrixType,UpLo> LLTType
[all...] |
| LDLT.h | 19 template<typename MatrixType, int UpLo> struct LDLT_Traits;
29 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
55 UpLo = _UpLo
65 typedef internal::LDLT_Traits<MatrixType,UpLo> Traits;
244 template<int UpLo> struct ldlt_inplace;
439 internal::ldlt_inplace<UpLo>::unblocked(m_matrix, m_transpositions, m_temporary, &m_sign);
471 internal::ldlt_inplace<UpLo>::update(m_matrix, m_transpositions, m_temporary, w, sigma);
573 template<typename MatrixType, unsigned int UpLo>
574 inline const LDLT<typename SelfAdjointView<MatrixType, UpLo>::PlainObject, UpLo>
[all...] |
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 102 template<typename _Scalar, int _Options, typename _Index, unsigned int UpLo>
103 cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<SparseMatrix<_Scalar,_Options,_Index>, UpLo>& mat)
107 if(UpLo==Upper) res.stype = 1;
108 if(UpLo==Lower) res.stype = -1;
159 enum { UpLo = _UpLo };
253 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
271 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 80 enum { UpLo = internal::traits<Derived>::UpLo };
261 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
313 enum { UpLo = _UpLo };
326 enum { UpLo = _UpLo };
339 enum { UpLo = _UpLo };
366 enum { UpLo = _UpLo };
454 enum { UpLo = _UpLo };
536 enum { UpLo = _UpLo };
544 typedef internal::traits<SimplicialLDLT<MatrixType,UpLo> > LDLTTraits
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 160 UpLo = _UpLo
211 internal::conjugate_gradient(mp_matrix->template selfadjointView<UpLo>(), b.col(j), xj,
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 557 * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX
570 enum { UpLo = _UpLo };
623 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>();
638 * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX
651 enum { UpLo = _UpLo };
705 out.template selfadjointView<Lower>() = matrix.template selfadjointView<UpLo>();
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 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.
492 enum { UpLo = _UpLo };
516 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
555 enum { UpLo = Options&(Upper|Lower) };
575 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 226 template<typename MatrixType, int UpLo = Lower> class LLT;
227 template<typename MatrixType, int UpLo = Lower> class LDLT;
|
| /external/eigen/test/ |
| sparse_solver.h | 149 halfA.template selfadjointView<Solver::UpLo>().rankUpdate(M);
212 halfA.template selfadjointView<Solver::UpLo>() = it.matrix().template triangularView<Eigen::Lower>().twistedBy(pnull);
|
