Struct bevy_rapier2d::prelude::nalgebra::linalg::QR [−][src]
pub struct QR<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>, { /* fields omitted */ }
Expand description
The QR decomposition of a general matrix.
Implementations
impl<T, R, C> QR<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, R, Const<1_usize>>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
[src]
impl<T, R, C> QR<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, R, Const<1_usize>>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
[src]Computes the QR 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>,
[src]
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>,
[src]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.
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>) 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>,
<<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output,
[src]
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>) 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>,
<<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output,
[src]Unpacks this decomposition into its two matrix factors.
impl<T, D> QR<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
[src]
impl<T, D> QR<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
[src]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
C2: Dim,
S2: Storage<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<T, R2, C2>,
[src]
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
C2: Dim,
S2: Storage<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<T, R2, C2>,
[src]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
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]
pub fn solve_mut<R2, C2, S2>(&self, b: &mut Matrix<T, R2, C2, S2>) -> bool where
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]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>>
[src]
pub fn try_inverse(
&self
) -> Option<Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>>
[src]Computes the inverse of the decomposed matrix.
Returns None
if the decomposed matrix is not invertible.
Indicates if the decomposed matrix is invertible.
Trait Implementations
impl<T, R, C> Copy for QR<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>,
Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer>: 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,
[src]Auto Trait Implementations
impl<T, R, C> !RefUnwindSafe for QR<T, R, C>
impl<T, R, C> !UnwindSafe for QR<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
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
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