Lines Matching full:sparse
40 * \brief Sparse left-looking rank-revealing QR factorization
43 * of sparse matrices. When a column has a norm less than a given tolerance
54 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
57 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
61 * \warning The input sparse matrix A must be in compressed mode (see SparseMatrix::makeCompressed()).
92 /** Computes the QR factorization of the sparse matrix \a mat.
114 /** \returns a const reference to the \b sparse upper triangular matrix R of the QR factorization.
128 /** \returns an expression of the matrix Q as products of sparse Householder reflectors.
141 * Internally, this call simply performs a sparse product between the matrix Q
142 * and a sparse identity matrix. However, due to the fact that the sparse
284 eigen_assert(mat.isCompressed() && "SparseQR requires a sparse matrix in compressed mode. Call .makeCompressed() before passing it to SparseQR");
320 * \param mat The sparse column-major matrix
373 * Sparse QR Factorization, ACM Trans. on Math. Soft. 38(1), 2011, Page 8:3
460 // FIXME: tval -= tdot * m_Q.col(curIdx) should amount to the same (need to check/add support for efficient "dense ?= sparse")
551 // Finalize the column pointers of the sparse matrices R and Q
692 // Sort the sparse householder reflectors if needed
