Home | History | Annotate | Download | only in SparseQR

Lines Matching defs:compute

101       * \sa compute()
105 compute(mat);
114 void compute(const MatrixType& mat)
151 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()");
194 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()");
199 // Compute Q^T * b;
230 * \sa compute()
235 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()");
242 eigen_assert(m_isInitialized && "The factorization should be called first, use compute()");
312 // Compute the column fill reducing ordering
325 // Compute the column elimination tree of the permuted matrix
359 ScalarVector tval(m); // The dense vector used to compute the current column
395 /* Compute the default threshold as in MatLab, see:
414 // Left looking rank-revealing QR factorization: compute a column of R and Q at a time
461 // Compute the pattern of Q(:,k)
478 // First compute q' * tval
508 // Compute the Householder reflection that eliminate the current column
621 //Compute res = Q' * other column by column
636 // Compute res = Q * other column by column