Lines Matching full:scalar
98 typedef _Scalar Scalar;
99 typedef typename NumTraits<Scalar>::Real RealScalar;
100 typedef Matrix<Scalar,Dynamic,1> Vector;
101 typedef SparseMatrix<Scalar,RowMajor> FactorType;
102 typedef SparseMatrix<Scalar,ColMajor> PermutType;
106 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
109 : m_droptol(NumTraits<Scalar>::dummy_precision()), m_fillfactor(10),
114 IncompleteLUT(const MatrixType& mat, const RealScalar& droptol=NumTraits<Scalar>::dummy_precision(), int fillfactor = 10)
149 IncompleteLUT<Scalar>& compute(const MatrixType& amat)
182 inline bool operator() (const Index& row, const Index& col, const Scalar&) const
205 template<typename Scalar>
206 void IncompleteLUT<Scalar>::setDroptol(const RealScalar& droptol)
215 template<typename Scalar>
216 void IncompleteLUT<Scalar>::setFillfactor(int fillfactor)
221 template <typename Scalar>
223 void IncompleteLUT<Scalar>::analyzePattern(const _MatrixType& amat)
226 SparseMatrix<Scalar,ColMajor, Index> mat1 = amat;
227 SparseMatrix<Scalar,ColMajor, Index> mat2 = amat.transpose();
231 SparseMatrix<Scalar,ColMajor, Index> AtA = mat2 + mat1;
233 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
240 template <typename Scalar>
242 void IncompleteLUT<Scalar>::factorize(const _MatrixType& amat)
258 SparseMatrix<Scalar,RowMajor, Index> mat;
349 Scalar fact = u(jj) / ki_it.value();
362 Scalar prod = fact * ki_it.value();
414 if (u(ii) == Scalar(0))
