Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::ColPivQR [−][src]
pub struct ColPivQR<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>, { /* fields omitted */ }
Expand description
The QR decomposition (with column pivoting) of a general matrix.
Implementations
impl<T, R, C> ColPivQR<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, R, Const<1_usize>>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> ColPivQR<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, R, Const<1_usize>>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
Computes the ColPivQR
decomposition using householder reflections.
Retrieves the upper trapezoidal submatrix R
of this decomposition.
pub fn unpack_r(
self
) -> Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Reallocator<T, R, C, <R as DimMin<C>>::Output, C>,
pub fn unpack_r(
self
) -> Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Reallocator<T, R, C, <R as DimMin<C>>::Output, C>,
Retrieves the upper trapezoidal submatrix R
of this decomposition.
This is usually faster than r
but consumes self
.
Computes the orthogonal matrix Q
of this decomposition.
Retrieves the column permutation of this decomposition.
pub fn unpack(
self
) -> (Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer>, PermutationSequence<<R as DimMin<C>>::Output>) where
<R as DimMin<C>>::Output: DimMin<C>,
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Reallocator<T, R, C, <R as DimMin<C>>::Output, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
<<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output,
pub fn unpack(
self
) -> (Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer>, PermutationSequence<<R as DimMin<C>>::Output>) where
<R as DimMin<C>>::Output: DimMin<C>,
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Reallocator<T, R, C, <R as DimMin<C>>::Output, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
<<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output,
Unpacks this decomposition into its two matrix factors.
impl<T, D> ColPivQR<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <D as DimMin<D>>::Output, Const<1_usize>>,
impl<T, D> ColPivQR<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <D as DimMin<D>>::Output, Const<1_usize>>,
pub fn solve<R2, C2, S2>(
&self,
b: &Matrix<T, R2, C2, S2>
) -> Option<Matrix<T, R2, C2, <DefaultAllocator as Allocator<T, R2, C2>>::Buffer>> where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<T, R2, C2>,
pub fn solve<R2, C2, S2>(
&self,
b: &Matrix<T, R2, C2, S2>
) -> Option<Matrix<T, R2, C2, <DefaultAllocator as Allocator<T, R2, C2>>::Buffer>> where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<T, R2, C2>,
Solves the linear system self * x = b
, where x
is the unknown to be determined.
Returns None
if self
is not invertible.
pub fn solve_mut<R2, C2, S2>(&self, b: &mut Matrix<T, R2, C2, S2>) -> bool where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_mut<R2, C2, S2>(&self, b: &mut Matrix<T, R2, C2, S2>) -> bool where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self * x = b
, where x
is the unknown to be determined.
If the decomposed matrix is not invertible, this returns false
and its input b
is
overwritten with garbage.
pub fn try_inverse(
&self
) -> Option<Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>>
pub fn try_inverse(
&self
) -> Option<Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>>
Computes the inverse of the decomposed matrix.
Returns None
if the decomposed matrix is not invertible.
Indicates if the decomposed matrix is invertible.
Computes the determinant of the decomposed matrix.
Trait Implementations
impl<T, R, C> Clone for ColPivQR<T, R, C> where
T: Clone + ComplexField,
R: Clone + DimMin<C>,
C: Clone + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Clone for ColPivQR<T, R, C> where
T: Clone + ComplexField,
R: Clone + DimMin<C>,
C: Clone + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Debug for ColPivQR<T, R, C> where
T: Debug + ComplexField,
R: Debug + DimMin<C>,
C: Debug + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Debug for ColPivQR<T, R, C> where
T: Debug + ComplexField,
R: Debug + DimMin<C>,
C: Debug + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Copy for ColPivQR<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer>: Copy,
PermutationSequence<<R as DimMin<C>>::Output>: Copy,
Matrix<T, <R as DimMin<C>>::Output, Const<1_usize>, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>>::Buffer>: Copy,
Auto Trait Implementations
impl<T, R, C> !RefUnwindSafe for ColPivQR<T, R, C>
impl<T, R, C> !UnwindSafe for ColPivQR<T, R, C>
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: 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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more