pub struct FullPivLU<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>, { /* private fields */ }
Expand description
LU decomposition with full row and column pivoting.
Implementations
sourceimpl<T, R, C> FullPivLU<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> FullPivLU<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
sourcepub fn new(
matrix: Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer>
) -> FullPivLU<T, R, C>
pub fn new(
matrix: Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer>
) -> FullPivLU<T, R, C>
Computes the LU decomposition with full pivoting of matrix
.
This effectively computes P, L, U, Q
such that P * matrix * Q = LU
.
sourcepub fn l(
&self
) -> Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
pub fn l(
&self
) -> Matrix<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
The lower triangular matrix of this decomposition.
sourcepub fn u(
&self
) -> Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
pub fn u(
&self
) -> Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
The upper triangular matrix of this decomposition.
sourcepub fn p(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
pub fn p(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
The row permutations of this decomposition.
sourcepub fn q(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
pub fn q(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
The column permutations of this decomposition.
sourcepub 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>, PermutationSequence<<R as DimMin<C>>::Output>) where
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
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>, PermutationSequence<<R as DimMin<C>>::Output>) where
DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, C>,
The two matrices of this decomposition and the row and column permutations: (P, L, U, Q)
.
sourceimpl<T, D> FullPivLU<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
impl<T, D> FullPivLU<T, D, D> where
T: ComplexField,
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
sourcepub 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: Storage<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: Storage<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 the decomposed matrix is not invertible.
sourcepub 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
may
be overwritten with garbage.
sourcepub 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.
sourcepub fn is_invertible(&self) -> bool
pub fn is_invertible(&self) -> bool
Indicates if the decomposed matrix is invertible.
sourcepub fn determinant(&self) -> T
pub fn determinant(&self) -> T
Computes the determinant of the decomposed matrix.
Trait Implementations
sourceimpl<T, R, C> Clone for FullPivLU<T, R, C> where
T: Clone + ComplexField,
R: Clone + DimMin<C>,
C: Clone + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Clone for FullPivLU<T, R, C> where
T: Clone + ComplexField,
R: Clone + DimMin<C>,
C: Clone + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
sourceimpl<T, R, C> Debug for FullPivLU<T, R, C> where
T: Debug + ComplexField,
R: Debug + DimMin<C>,
C: Debug + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Debug for FullPivLU<T, R, C> where
T: Debug + ComplexField,
R: Debug + DimMin<C>,
C: Debug + Dim,
DefaultAllocator: Allocator<T, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, Const<1_usize>>,
impl<T, R, C> Copy for FullPivLU<T, R, C> where
T: ComplexField,
R: DimMin<C>,
C: Dim,
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,
Auto Trait Implementations
impl<T, R, C> !RefUnwindSafe for FullPivLU<T, R, C>
impl<T, R, C> !Send for FullPivLU<T, R, C>
impl<T, R, C> !Sync for FullPivLU<T, R, C>
impl<T, R, C> !Unpin for FullPivLU<T, R, C>
impl<T, R, C> !UnwindSafe for FullPivLU<T, R, C>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
sourcefn 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 more
sourcefn 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).
sourcefn 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.
sourcefn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more