\returns an expression of the adjoint of the factored matrix * * A typical usage is to solve for the adjoint problem A' x = b: * \co

\returns the number of columns of the represented matrix. */

\returns the vertex of the bounding box at the corner defined by * the corner-id corner. It works only for a 1D, 2D or 3D bounding box. * For

\returns the dimension in which the plane holds */

\returns the step bound for the diagonal shift */

inverse complex-to-complex

\brief Returns number of performed QR-like iterations. */

\returns a const pointer to the array of the starting positions of the inner vectors. * This function is aimed at interoperability with other li

Sets the tolerance for the norm of the vector function*/

Sets the tolerance for the norm of the solution vector*/

Helper function for bit packing snippet of low precision comparison. It packs the flags from 16x16 to 8x16.

Helper function for bit packing snippet of low precision comparison. It packs the flags from 32x16 to 16x16.

PopBackHalf removes and returns half last elements in the queue. Returns number of elements removed.

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

\returns The value of the first angle. */

\returns The value of the second angle. */

* \returns the starting index of the bi row block */

* Return the pointers to the beginning of each column in \ref valuePtr() */

\returns the number of columns of the matrix */

\returns the tolerance error reached during the last solve. * It is a close approximation of the true relative residual error |Ax-b|/|b|. */

\returns the matrix or vector obtained by evaluating this expression. * * Notice that in the case of a plain matrix or vector (not an expr

complex-to-complex forward FFT

\returns a const pointer to the array of inner indices. * This function is aimed at interoperability with other libraries. * \sa valuePtr(