Base class of SVD algorithms. More...
Public Member Functions | |
Index | cols () const |
bool | computeU () const |
bool | computeV () const |
Derived & | derived () |
const Derived & | derived () const |
ComputationInfo | info () const |
Reports whether previous computation was successful. More... | |
const MatrixUType & | matrixU () const |
const MatrixVType & | matrixV () const |
Index | nonzeroSingularValues () const |
Index | rank () const |
Index | rows () const |
Derived & | setThreshold (const RealScalar &threshold) |
Derived & | setThreshold (Default_t) |
const SingularValuesType & | singularValues () const |
template<typename Rhs > | |
const Solve< Derived, Rhs > | solve (const MatrixBase< Rhs > &b) const |
RealScalar | threshold () const |
Public Member Functions inherited from Eigen::SolverBase< SVDBase< Derived > > | |
const AdjointReturnType | adjoint () const |
SVDBase< Derived > & | derived () |
const SVDBase< Derived > & | derived () const |
const Solve< SVDBase< Derived >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
SolverBase () | |
const ConstTransposeReturnType | transpose () const |
~SolverBase () | |
Public Member Functions inherited from Eigen::EigenBase< Derived > | |
template<typename Dest > | |
void | addTo (Dest &dst) const |
template<typename Dest > | |
void | applyThisOnTheLeft (Dest &dst) const |
template<typename Dest > | |
void | applyThisOnTheRight (Dest &dst) const |
EIGEN_CONSTEXPR Index | cols () const EIGEN_NOEXCEPT |
Derived & | const_cast_derived () const |
const Derived & | const_derived () const |
Derived & | derived () |
const Derived & | derived () const |
template<typename Dest > | |
void | evalTo (Dest &dst) const |
EIGEN_CONSTEXPR Index | rows () const EIGEN_NOEXCEPT |
EIGEN_CONSTEXPR Index | size () const EIGEN_NOEXCEPT |
template<typename Dest > | |
void | subTo (Dest &dst) const |
Static Public Attributes | |
static constexpr bool | ShouldComputeFullU |
static constexpr bool | ShouldComputeFullV |
static constexpr bool | ShouldComputeThinU |
static constexpr bool | ShouldComputeThinV |
Protected Member Functions | |
void | _check_compute_assertions () const |
template<bool Transpose_, typename Rhs > | |
void | _check_solve_assertion (const Rhs &b) const |
bool | allocate (Index rows, Index cols, unsigned int computationOptions) |
SVDBase () | |
Default Constructor. More... | |
Protected Member Functions inherited from Eigen::SolverBase< SVDBase< Derived > > | |
void | _check_solve_assertion (const Rhs &b) const |
Base class of SVD algorithms.
Derived | the type of the actual SVD decomposition |
SVD decomposition consists in decomposing any n-by-p matrix A as a product
\[ A = U S V^* \]
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 retrieved 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.
typedef Eigen::Index Eigen::SVDBase< Derived >::Index |
typedef internal::traits<Derived>::MatrixType Eigen::SVDBase< Derived >::MatrixType |
typedef internal::make_proper_matrix_type<Scalar, RowsAtCompileTime, MatrixUColsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MatrixUMaxColsAtCompileTime>::type Eigen::SVDBase< Derived >::MatrixUType |
typedef internal::make_proper_matrix_type<Scalar, ColsAtCompileTime, MatrixVColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MatrixVMaxColsAtCompileTime>::type Eigen::SVDBase< Derived >::MatrixVType |
typedef NumTraits<typename MatrixType::Scalar>::Real Eigen::SVDBase< Derived >::RealScalar |
typedef MatrixType::Scalar Eigen::SVDBase< Derived >::Scalar |
typedef internal::plain_diag_type<MatrixType, RealScalar>::type Eigen::SVDBase< Derived >::SingularValuesType |
typedef Eigen::internal::traits<SVDBase>::StorageIndex Eigen::SVDBase< Derived >::StorageIndex |
anonymous enum |
Definition at line 137 of file SVDBase.h.
|
inlineprotected |
Default Constructor.
Default constructor of SVDBase
Definition at line 358 of file SVDBase.h.
|
inlineprotected |
|
inlineprotected |
Definition at line 333 of file SVDBase.h.
|
protected |
Definition at line 410 of file SVDBase.h.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Reports whether previous computation was successful.
Success
if computation was successful.
|
inline |
For the SVD decomposition of a n-by-p matrix, letting m be the minimum of n and p, the U matrix is n-by-n if you asked for ComputeFullU , and is n-by-m if you asked for ComputeThinU .
The m first columns of U are the left singular vectors of the matrix being decomposed.
This method asserts that you asked for U to be computed.
Definition at line 175 of file SVDBase.h.
|
inline |
For the SVD decomposition of a n-by-p matrix, letting m be the minimum of n and p, the V matrix is p-by-p if you asked for ComputeFullV , and is p-by-m if you asked for ComputeThinV .
The m first columns of V are the right singular vectors of the matrix being decomposed.
This method asserts that you asked for V to be computed.
Definition at line 191 of file SVDBase.h.
|
inline |
|
inline |
*this
is the SVD.Definition at line 222 of file SVDBase.h.
|
inline |
|
inline |
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()
threshold | The new value to use as the threshold. |
A singular value will be considered nonzero if its value is strictly greater than \( \vert singular value \vert \leqslant threshold \times \vert max singular value \vert \).
If you want to come back to the default behavior, call setThreshold(Default_t)
Definition at line 247 of file SVDBase.h.
|
inline |
Allows to come back to the default behavior, letting Eigen use its default formula for determining the threshold.
You should pass the special object Eigen::Default as parameter here.
See the documentation of setThreshold(const RealScalar&).
|
inline |
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. |
|
inline |
Returns the threshold that will be used by certain methods such as rank().
See the documentation of setThreshold(const RealScalar&).
Definition at line 272 of file SVDBase.h.
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
staticconstexpr |
|
staticconstexpr |
|
staticconstexpr |
|
staticconstexpr |