\sa MapBase::innerStride() */

\returns the norm of the quaternion's coefficients * \sa QuaternionBase::squaredNorm(), MatrixBase::norm() */

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

\returns the \c z coefficient */

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

inverse complex-to-complex

\brief Constructs the Hessenberg matrix H in the decomposition * * \returns expression object representing the matrix H * * \p

\returns the matrix \b Z. */

Resizes the matrix to a \a rows x \a cols matrix and initializes it to zero. * * This function does not free the currently allocated memo

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

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

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