Struct nalgebra::linalg::UDU[][src]

pub struct UDU<N: RealField, D: Dim> where
    DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>, 
{ pub u: MatrixN<N, D>, pub d: VectorN<N, D>, }
Expand description

UDU factorization.

Fields

u: MatrixN<N, D>

The upper triangular matrix resulting from the factorization

d: VectorN<N, D>

The diagonal matrix resulting from the factorization

Implementations

Computes the UDU^T factorization.

The input matrix p is assumed to be symmetric and this decomposition will only read the upper-triangular part of p.

Ref.: “Optimal control and estimation-Dover Publications”, Robert F. Stengel, (1994) page 360

Returns the diagonal elements as a matrix

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

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)

recently added

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.