Struct nalgebra::linalg::SVD[][src]

pub struct SVD<T: ComplexField, R: DimMin<C>, C: Dim> where
    DefaultAllocator: Allocator<T, DimMinimum<R, C>, C> + Allocator<T, R, DimMinimum<R, C>> + Allocator<T::RealField, DimMinimum<R, C>>, 
{ pub u: Option<OMatrix<T, R, DimMinimum<R, C>>>, pub v_t: Option<OMatrix<T, DimMinimum<R, C>, C>>, pub singular_values: OVector<T::RealField, DimMinimum<R, C>>, }
Expand description

Singular Value Decomposition of a general matrix.

Fields

u: Option<OMatrix<T, R, DimMinimum<R, C>>>

The left-singular vectors U of this SVD.

v_t: Option<OMatrix<T, DimMinimum<R, C>, C>>

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

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

The singular values of this SVD.

Implementations

Computes the Singular Value Decomposition of matrix using implicit shift.

Attempts to compute the Singular Value Decomposition of matrix using implicit shift.

Arguments
  • compute_u − set this to true to enable the computation of left-singular vectors.
  • compute_v − set this to true to enable the computation of right-singular vectors.
  • eps − tolerance used to determine when a value converged to 0.
  • max_niter − maximum total number of iterations performed by the algorithm. If this number of iteration is exceeded, None is returned. If niter == 0, then the algorithm continues indefinitely until convergence.

Computes the rank of the decomposed matrix, i.e., the number of singular values greater than eps.

Rebuild the original matrix.

This is useful if some of the singular values have been manually modified. Returns Err if the right- and left- singular vectors have not been computed at construction-time.

Computes the pseudo-inverse of the decomposed matrix.

Any singular value smaller than eps is assumed to be zero. Returns Err if the right- and left- singular vectors have not been computed at construction-time.

Solves the system self * x = b where self is the decomposed matrix and x the unknown.

Any singular value smaller than eps is assumed to be zero. Returns Err if the singular vectors U and V have not been computed.

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

Deserialize this value from the given Serde deserializer. Read more

Serialize this value into the given Serde serializer. 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

Performs the conversion.

Performs the conversion.

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

🔬 This is a nightly-only experimental API. (toowned_clone_into)

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.