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>, }
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
impl<T: RealField, D: Dim> UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]
impl<T: RealField, D: Dim> UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]pub fn new(p: OMatrix<T, D, D>) -> Option<Self>
[src]
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
pub fn d_matrix(&self) -> OMatrix<T, D, D>
[src]
Returns the diagonal elements as a matrix
Trait Implementations
impl<T: Clone + RealField, D: Clone + Dim> Clone for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]
impl<T: Clone + RealField, D: Clone + Dim> Clone for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]Auto Trait Implementations
impl<T, D> !RefUnwindSafe for UDU<T, D>
impl<T, D> !RefUnwindSafe for UDU<T, D>
impl<T, D> !UnwindSafe for UDU<T, D>
impl<T, D> !UnwindSafe for UDU<T, D>
Blanket Implementations
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,