pub struct UDU<T, D>{
pub u: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
pub d: Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>,
}
Expand description
UDU factorization.
Fields§
§u: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>
The upper triangular matrix resulting from the factorization
d: Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>
The diagonal matrix resulting from the factorization
Implementations§
Source§impl<T, D> UDU<T, D>
impl<T, D> UDU<T, D>
Sourcepub fn new(
p: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
) -> Option<UDU<T, D>>
pub fn new( p: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, ) -> Option<UDU<T, D>>
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§
Source§impl<'de, T, D> Deserialize<'de> for UDU<T, D>where
T: RealField,
D: Dim,
DefaultAllocator: Allocator<D> + Allocator<D, D>,
Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>: Deserialize<'de>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Deserialize<'de>,
impl<'de, T, D> Deserialize<'de> for UDU<T, D>where
T: RealField,
D: Dim,
DefaultAllocator: Allocator<D> + Allocator<D, D>,
Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>: Deserialize<'de>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Deserialize<'de>,
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<UDU<T, D>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<UDU<T, D>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<T, D> Serialize for UDU<T, D>
impl<T, D> Serialize for UDU<T, D>
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<T, D> Copy for UDU<T, D>
Auto Trait Implementations§
impl<T, D> !Freeze for UDU<T, D>
impl<T, D> !RefUnwindSafe for UDU<T, D>
impl<T, D> !Send for UDU<T, D>
impl<T, D> !Sync for UDU<T, D>
impl<T, D> !Unpin for UDU<T, D>
impl<T, D> !UnwindSafe for UDU<T, D>
Blanket Implementations§
Source§impl<T> AsyncTaskResult for T
impl<T> AsyncTaskResult for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.fn into_any(self: Box<T>) -> Box<dyn Any>
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> ScriptMessagePayload for T
impl<T> ScriptMessagePayload for T
Source§fn as_any_ref(&self) -> &(dyn Any + 'static)
fn as_any_ref(&self) -> &(dyn Any + 'static)
Returns
self
as &dyn Any
Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Returns
self
as &dyn Any
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.