Home | History | Annotate | Download | only in IterativeSolvers

Lines Matching refs:Scalar

29 template <typename Scalar, int _UpLo = Lower, typename _OrderingType = NaturalOrdering<int> >
33 typedef SparseMatrix<Scalar,ColMajor> MatrixType;
38 typedef Matrix<Scalar,Dynamic,1> ScalarType;
68 void setShift( Scalar shift) { m_shift = shift; }
116 SparseMatrix<Scalar,ColMajor> m_L; // The lower part stored in CSC
118 Scalar m_shift; //The initial shift parameter
130 template<typename Scalar, int _UpLo, typename OrderingType>
132 void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType& mat)
165 Scalar mindiag = vals[0];
172 if(mindiag < Scalar(0.)) m_shift = m_shift - mindiag;
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored
239 template<typename Scalar, int _UpLo, typename OrderingType>
241 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol)