Struct nalgebra::linalg::UDU [−][src]
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
impl<N: RealField, D: Dim> UDU<N, D> where
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
pub fn new(p: MatrixN<N, 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) -> MatrixN<N, D>
[src]
Returns the diagonal elements as a matrix
Trait Implementations
impl<N: Clone + RealField, D: Clone + Dim> Clone for UDU<N, D> where
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
impl<N: RealField, D: Dim> Copy for UDU<N, D> where
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
VectorN<N, D>: Copy,
MatrixN<N, D>: Copy,
[src]
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
VectorN<N, D>: Copy,
MatrixN<N, D>: Copy,
impl<N: Debug + RealField, D: Debug + Dim> Debug for UDU<N, D> where
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D> + Allocator<N, D, D>,
Auto Trait Implementations
impl<N, D> !RefUnwindSafe for UDU<N, D>
impl<N, D> !Send for UDU<N, D>
impl<N, D> !Sync for UDU<N, D>
impl<N, D> !Unpin for UDU<N, D>
impl<N, D> !UnwindSafe for UDU<N, D>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,
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<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,