![]() |
Eigen-unsupported
3.2.7
|
class Bidiagonal Divide and Conquer SVD
MatrixType | the type of the matrix of which we are computing the SVD decomposition We plan to have a very similar interface to JacobiSVD on this class. It should be used to speed up the calcul of SVD for big matrices. |
Public Member Functions | |
BDCSVD () | |
Default Constructor. More... | |
BDCSVD (Index rows, Index cols, unsigned int computationOptions=0) | |
Default Constructor with memory preallocation. More... | |
BDCSVD (const MatrixType &matrix, unsigned int computationOptions=0) | |
Constructor performing the decomposition of given matrix. More... | |
SVDBase< MatrixType > & | compute (const MatrixType &matrix, unsigned int computationOptions) |
Method performing the decomposition of given matrix using custom options. More... | |
SVDBase< MatrixType > & | compute (const MatrixType &matrix) |
Method performing the decomposition of given matrix using current options. More... | |
bool | computeU () const |
bool | computeV () const |
Index | nonzeroSingularValues () const |
const SingularValuesType & | singularValues () const |
template<typename Rhs > | |
const internal::solve_retval < BDCSVD, Rhs > | solve (const MatrixBase< Rhs > &b) const |
|
inline |
Default Constructor.
The default constructor is useful in cases in which the user intends to perform decompositions via BDCSVD::compute(const MatrixType&).
|
inline |
Default Constructor with memory preallocation.
Like the default constructor but with preallocation of the internal data according to the specified problem size.
|
inline |
Constructor performing the decomposition of given matrix.
matrix | the matrix to decompose |
computationOptions | optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. By default, none is computed. This is a bit - field, the possible bits are #ComputeFullU, #ComputeThinU, #ComputeFullV, #ComputeThinV. |
Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not available with the (non - default) FullPivHouseholderQR preconditioner.
References BDCSVD< _MatrixType >::compute().
SVDBase< MatrixType > & compute | ( | const MatrixType & | matrix, |
unsigned int | computationOptions | ||
) |
Method performing the decomposition of given matrix using custom options.
matrix | the matrix to decompose |
computationOptions | optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. By default, none is computed. This is a bit - field, the possible bits are #ComputeFullU, #ComputeThinU, #ComputeFullV, #ComputeThinV. |
Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not available with the (non - default) FullPivHouseholderQR preconditioner.
Referenced by BDCSVD< _MatrixType >::BDCSVD(), and BDCSVD< _MatrixType >::compute().
|
inline |
Method performing the decomposition of given matrix using current options.
matrix | the matrix to decompose |
This method uses the current computationOptions, as already passed to the constructor or to compute(const MatrixType&, unsigned int).
References BDCSVD< _MatrixType >::compute().
|
inlineinherited |
Referenced by SVDBase< _MatrixType >::matrixU().
|
inlineinherited |
Referenced by SVDBase< _MatrixType >::matrixV().
|
inlineinherited |
|
inlineinherited |
For the SVD decomposition of a n-by-p matrix, letting m be the minimum of n and p, the returned vector has size m. Singular values are always sorted in decreasing order.
|
inline |
b | the right - hand - side of the equation to solve. |