149     void analyzePattern(const MatrixType& amat);
152     void factorize(const MatrixType& amat);
160     IncompleteLUT& compute(const MatrixType& amat)  in compute()  argument
162       analyzePattern(amat);   in compute()
163       factorize(amat);  in compute()
223 void IncompleteLUT<Scalar,StorageIndex>::analyzePattern(const _MatrixType& amat)  in analyzePattern()  argument
230   SparseMatrix<Scalar,ColMajor, StorageIndex> mat1 = amat;  in analyzePattern()
231   SparseMatrix<Scalar,ColMajor, StorageIndex> mat2 = amat.transpose();  in analyzePattern()
240   SparseMatrix<Scalar,ColMajor, StorageIndex> mat1 = amat;  in analyzePattern()
253 void IncompleteLUT<Scalar,StorageIndex>::factorize(const _MatrixType& amat)  in factorize()  argument
260 …eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix"…  in factorize()
261   Index n = amat.cols();  // Size of the matrix  in factorize()
271   mat = amat.twistedBy(m_Pinv);  in factorize()
279   Index fill_in = (amat.nonZeros()*m_fillfactor)/n + 1;  in factorize()