Struct bevy_rapier2d::prelude::nalgebra::linalg::LU [−][src]
pub struct LU<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>, { /* fields omitted */ }
Expand description
LU decomposition with partial (row) pivoting.
Implementations
Computes the LU decomposition with partial (row) pivoting of matrix
.
The lower triangular matrix of this decomposition.
pub fn l_unpack(
self
) -> Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Reallocator<T, R, C, R, <R as DimMin<C>>::Output>,
[src]
pub fn l_unpack(
self
) -> Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Reallocator<T, R, C, R, <R as DimMin<C>>::Output>,
[src]The lower triangular matrix of this decomposition.
The upper triangular matrix of this decomposition.
The row permutations of this decomposition.
pub fn unpack(
self
) -> (PermutationSequence<<R as DimMin<C>>::Output>, 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
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
DefaultAllocator: Reallocator<T, R, C, R, <R as DimMin<C>>::Output>,
[src]
pub fn unpack(
self
) -> (PermutationSequence<<R as DimMin<C>>::Output>, 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
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
DefaultAllocator: Reallocator<T, R, C, R, <R as DimMin<C>>::Output>,
[src]The row permutations and two triangular matrices of this decomposition: (P, L, U)
.
impl<T, D> LU<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
[src]
impl<T, D> LU<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<(usize, usize), 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
may
be 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 matrix is not invertible.
pub fn try_inverse_to<S2>(&self, out: &mut Matrix<T, D, D, S2>) -> bool where
S2: StorageMut<T, D, D>,
[src]
pub fn try_inverse_to<S2>(&self, out: &mut Matrix<T, D, D, S2>) -> bool where
S2: StorageMut<T, D, D>,
[src]Computes the inverse of the decomposed matrix and outputs the result to out
.
If the decomposed matrix is not invertible, this returns false
and out
may be
overwritten with garbage.
Computes the determinant of the decomposed matrix.
Indicates if the decomposed matrix is invertible.
Trait Implementations
impl<T, R, C> Copy for LU<T, R, C> where
C: Dim,
T: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<T, R, C>,
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,
[src]Auto Trait Implementations
impl<T, R, C> !RefUnwindSafe for LU<T, R, C>
impl<T, R, C> !UnwindSafe for LU<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