Turns the matrix into the \em compressed format. */

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

\returns the \c y coefficient */

\sa MapBase::innerStride() */

r""" Give the probabilities of new sample being assigned to different classes. Parameters ---------- X : arra

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

\brief Retruns the z-translation by value. **/

\returns the \c z coefficient */

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

\internal Frees memory allocated with aligned_malloc. */

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

\internal * Resize the nonzero vector to \a size */

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

Perform the solving operation \f$y=B^{-1}x\f$. \param x_in Pointer to the \f$x\f$ vector. \param y_out Pointer to the \f$y\f$ vector. y_out = inv(B

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

required by sycl in order to extract the accessor

\returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */

The "A" operator to generate the Krylov subspace

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

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