\returns an expression of the matrix Q as products of sparse Householder reflectors. * The common usage of this function is to apply it to a dense

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

\returns the number of non zero coefficients */

\returns the outer-stride of the underlying dense matrix * \sa DenseCoeffsBase::outerStride() */

\internal flip the real & imaginary results and packet conjugate */

\returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */

\returns the number of transpositions */

* Return the array of supernode-to-column mapping */

\returns an expression of P H P^-1 where H is the matrix represented by \c *this */

\brief Adjoint (conjugate transpose) of the Householder sequence. */

\internal Allocates \a size bytes. The returned pointer is guaranteed to have 16 or 32 bytes alignment depending on the requirements. * On allocatio

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

\returns number of columns */

\internal Like malloc, but the returned pointer is guaranteed to be aligned to `alignment`. * Fast, but wastes `alignment` additional bytes of memor

\returns a const pointer to the array of the number of non zeros of the inner vectors. * This function is aimed at interoperability with other l

\returns whether \c *this is in compressed form. */

\internal load a full vector from complex location - column-wise */

\returns the rank of the matrix of which *this is the complete orthogonal * decomposition. * * \note This method has to determine which pivot

\returns number of rows */

\returns the number of columns. \sa rows() */