PopFront removes and returns the first element in the queue. If the queue was empty returns default-constructed Work.

* Parameters: * precision: enum, Precision of the transform: DFTI_SINGLE or DFTI_DOUBLE. * forward_domain: enum, Forward domain of the transform: DF

\internal Calculate logical XOR at compile time

\returns the sparse triangular factor R. It is a sparse matrix */

\returns the matrix \b Z. */

Sets *this to the identity matrix. * This function also turns the matrix into compressed mode, and drop any reserved memory. */

\internal Frees memory allocated with aligned_malloc. */

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

\brief Analyze and factorize the matrix so the solver is ready to solve. * * Compute the symbolic and numeric factorization of the input sparse

\returns the dimension of the kernel of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pivots s

complex-to-complex forward FFT

\brief Constructs the Hessenberg matrix H in the decomposition * * \returns expression object representing the matrix H * * \pre Either th