|
enum | {
RowsAtCompileTime = MatrixType::RowsAtCompileTime
, ColsAtCompileTime = MatrixType::ColsAtCompileTime
, DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime)
, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime
,
MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime
, MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime,MaxColsAtCompileTime)
, MatrixOptions = MatrixType::Options
} |
|
typedef internal::traits< Derived >::MatrixType | MatrixType |
|
typedef MatrixType::Scalar | Scalar |
|
typedef NumTraits< typename MatrixType::Scalar >::Real | RealScalar |
|
typedef Eigen::internal::traits< SVDBase >::StorageIndex | StorageIndex |
|
typedef Eigen::Index | Index |
|
typedef Matrix< Scalar, RowsAtCompileTime, RowsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MaxRowsAtCompileTime > | MatrixUType |
|
typedef Matrix< Scalar, ColsAtCompileTime, ColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MaxColsAtCompileTime > | MatrixVType |
|
typedef internal::plain_diag_type< MatrixType, RealScalar >::type | SingularValuesType |
|
enum | |
|
typedef EigenBase< SVDBase< Derived > > | Base |
|
typedef internal::traits< SVDBase< Derived > >::Scalar | Scalar |
|
typedef Scalar | CoeffReturnType |
|
typedef internal::add_const< Transpose< const SVDBase< Derived > > >::type | ConstTransposeReturnType |
|
typedef internal::conditional< NumTraits< Scalar >::IsComplex, CwiseUnaryOp< internal::scalar_conjugate_op< Scalar >, ConstTransposeReturnType >, ConstTransposeReturnType >::type | AdjointReturnType |
|
typedef Eigen::Index | Index |
| The interface type of indices. More...
|
|
typedef internal::traits< Derived >::StorageKind | StorageKind |
|
template<typename Derived>
class Eigen::SVDBase< Derived >
Base class of SVD algorithms.
- Template Parameters
-
Derived | the type of the actual SVD decomposition |
SVD decomposition consists in decomposing any n-by-p matrix A as a product
where U is a n-by-n unitary, V is a p-by-p unitary, and S is a n-by-p real positive matrix which is zero outside of its main diagonal; the diagonal entries of S are known as the singular values of A and the columns of U and V are known as the left and right singular vectors of A respectively.
Singular values are always sorted in decreasing order.
You can ask for only thin U or V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting m be the smaller value among n and p, there are only m singular vectors; the remaining columns of U and V do not correspond to actual singular vectors. Asking for thin U or V means asking for only their m first columns to be formed. So U is then a n-by-m matrix, and V is then a p-by-m matrix. Notice that thin U and V are all you need for (least squares) solving.
The status of the computation can be retrived using the info() method. Unless info() returns Success, the results should be not considered well defined.
If the input matrix has inf or nan coefficients, the result of the computation is undefined, and info() will return InvalidInput, but the computation is guaranteed to terminate in finite (and reasonable) time.
- See also
- class BDCSVD, class JacobiSVD
template<typename Derived >
Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(), which need to determine when singular values are to be considered nonzero. This is not used for the SVD decomposition itself.
When it needs to get the threshold value, Eigen calls threshold(). The default is NumTraits<Scalar>::epsilon()
- Parameters
-
threshold | The new value to use as the threshold. |
A singular value will be considered nonzero if its value is strictly greater than
.
If you want to come back to the default behavior, call setThreshold(Default_t)