Struct nalgebra_lapack::SVD

source ·
pub struct SVD<T: Scalar, R: DimMin<C>, C: Dim>where
    DefaultAllocator: Allocator<T, R, R> + Allocator<T, DimMinimum<R, C>> + Allocator<T, C, C>,
{ pub u: OMatrix<T, R, R>, pub vt: OMatrix<T, C, C>, pub singular_values: OVector<T, DimMinimum<R, C>>, }
Expand description

The SVD decomposition of a general matrix.

Fields§

§u: OMatrix<T, R, R>

The left-singular vectors U of this SVD.

§vt: OMatrix<T, C, C>

The right-singular vectors V^t of this SVD.

§singular_values: OVector<T, DimMinimum<R, C>>

The singular values of this SVD.

Implementations§

Computes the Singular Value Decomposition of matrix.

Reconstructs the matrix from its decomposition.

Useful if some components (e.g. some singular values) of this decomposition have been manually changed by the user.

Computes the pseudo-inverse of the decomposed matrix.

All singular value below epsilon will be set to zero instead of being inverted.

The rank of the decomposed matrix.

This is the number of singular values that are not too small (i.e. greater than the given epsilon).

Reconstructs the matrix from its decomposition.

Useful if some components (e.g. some singular values) of this decomposition have been manually changed by the user.

Computes the pseudo-inverse of the decomposed matrix.

All singular value below epsilon will be set to zero instead of being inverted.

The rank of the decomposed matrix.

This is the number of singular values that are not too small (i.e. greater than the given epsilon).

Trait Implementations§

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.