Arnoldi factorization starting from step-k

inline Index row() const { return (ArgType::Flags&RowMajorBit ? Base::outer() : this->index()); } inline Index col() const { return (ArgType::Flags&Ro

inline Scalar *valuePtr(){ return m_values; }

\returns the inverse of the matrix of which *this is the LU decomposition. * * \note If this matrix is not invertible, the returned matrix

Sets the last row to [0 ... 0 1] */

\returns an expression of the matrix Q as products of sparse Householder reflectors. * The common usage of this function is to apply it to a dense

The converged right singular vectors

Fill the given vector with random numbers Ranging from -0.5 to 0.5

*/

* Get the number of rows of the input matrix and the Q matrix */

\internal */

Return the number of rows of the underlying matrix.

Return the number of rows of the underlying matrix.

Sets the maximum number of function evaluation */

Sort the eigen pairs according to the selection rule \param selection Sorting rule

* Return the array of supernode-to-column mapping */

r""" For PCA model, apply dimensionality reduction to given data. Parameters ---------- X : array-like, shape

* Return the array of nonzero values packed by column * * The size is nnz */

CommitWait commits waiting.

Q = P0 * P1 * ... YQ = Y * P0 * P1 * ...