* \brief Set the number of rows and columns blocks */

\returns the number of coefficients, which is \a rows()*cols(). * \sa rows(), cols(), SizeAtCompileTime. */

TODO:

PushBack adds w at the end of the queue. If queue is full returns w, otherwise returns default-constructed Work.

\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 dimension of the kernel of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pi

required by sycl in order to extract the accessor

\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 the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */

Uniformly distributed random number generation a = random(seed); <- initialization & first random number generation a = random(); <- next random n

\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. */

action name

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

Preallocates \a reserveSize non zeros */

\brief Number of rows of transformation viewed as a matrix. * \returns Number of rows * \details This equals the dimension of the space t

* \returns the number of rows */

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

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