Struct nalgebra::linalg::UDU [−][src]
pub struct UDU<T: RealField, D: Dim> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>, {
pub u: OMatrix<T, D, D>,
pub d: OVector<T, D>,
}
Expand description
UDU factorization.
Fields
u: OMatrix<T, D, D>
The upper triangular matrix resulting from the factorization
d: OVector<T, 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
Trait Implementations
impl<'de, T: RealField, D: Dim> Deserialize<'de> for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
OVector<T, D>: Deserialize<'de>,
OMatrix<T, D, D>: Deserialize<'de>,
impl<'de, T: RealField, D: Dim> Deserialize<'de> for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
OVector<T, D>: Deserialize<'de>,
OMatrix<T, D, D>: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations
impl<T, D> !RefUnwindSafe for UDU<T, D>
impl<T, D> !UnwindSafe for UDU<T, D>
Blanket Implementations
Mutably borrows from an owned value. Read more
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.