HomeSort by relevance Sort by last modified time
    Searched refs:AMDOrdering (Results 1 - 6 of 6) sorted by null

  /external/eigen/test/
incomplete_cholesky.cpp 18 ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_lower_amd;
20 ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I> > > cg_illt_upper_amd;
22 ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_uplo_amd;
sparselu.cpp 25 SparseLU<SparseMatrix<T, ColMajor>, AMDOrdering<int> > sparselu_amd;
  /external/eigen/Eigen/src/OrderingMethods/
Ordering.h 44 * \class AMDOrdering
52 class AMDOrdering
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 266 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::StorageIndex> > class SimplicialLLT;
267 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::StorageIndex> > class SimplicialLDLT;
268 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::StorageIndex> > class SimplicialCholesky;
323 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<>
327 * \sa class SimplicialLDLT, class AMDOrdering, class NaturalOrdering
414 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<>
418 * \sa class SimplicialLLT, class AMDOrdering, class NaturalOrdering
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteCholesky.h 27 * \tparam _OrderingType The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<int>,
46 AMDOrdering<int>
IncompleteLUT.h 235 AMDOrdering<StorageIndex> ordering;

Completed in 764 milliseconds