[−][src]Struct na::linalg::FullPivLU
LU decomposition with full row and column pivoting.
Implementations
impl<N, R, C> FullPivLU<N, R, C> where
C: Dim,
N: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
[src]
C: Dim,
N: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
pub fn new(
matrix: Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>
) -> FullPivLU<N, R, C>
[src]
matrix: Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>
) -> FullPivLU<N, R, C>
Computes the LU decomposition with full pivoting of matrix
.
This effectively computes P, L, U, Q
such that P * matrix * Q = LU
.
pub fn l(
&self
) -> Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,
[src]
&self
) -> Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer> where
DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,
The lower triangular matrix of this decomposition.
pub fn u(
&self
) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,
[src]
&self
) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where
DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,
The upper triangular matrix of this decomposition.
pub fn p(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
[src]
The row permutations of this decomposition.
pub fn q(&self) -> &PermutationSequence<<R as DimMin<C>>::Output>
[src]
The column permutations of this decomposition.
pub fn unpack(
self
) -> (PermutationSequence<<R as DimMin<C>>::Output>, Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer>, PermutationSequence<<R as DimMin<C>>::Output>) where
DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,
[src]
self
) -> (PermutationSequence<<R as DimMin<C>>::Output>, Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer>, PermutationSequence<<R as DimMin<C>>::Output>) where
DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,
DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,
The two matrices of this decomposition and the row and column permutations: (P, L, U, Q)
.
impl<N, D> FullPivLU<N, D, D> where
D: DimMin<D, Output = D>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<(usize, usize), D, U1>,
[src]
D: DimMin<D, Output = D>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<(usize, usize), D, U1>,
pub fn solve<R2, C2, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<Matrix<N, R2, C2, <DefaultAllocator as Allocator<N, R2, C2>>::Buffer>> where
C2: Dim,
R2: Dim,
S2: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<N, R2, C2>,
[src]
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<Matrix<N, R2, C2, <DefaultAllocator as Allocator<N, R2, C2>>::Buffer>> where
C2: Dim,
R2: Dim,
S2: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<N, 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.
pub fn solve_mut<R2, C2, S2>(&self, b: &mut Matrix<N, R2, C2, S2>) -> bool where
C2: Dim,
R2: Dim,
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]
C2: Dim,
R2: Dim,
S2: StorageMut<N, 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.
pub fn try_inverse(
&self
) -> Option<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>>
[src]
&self
) -> Option<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>>
Computes the inverse of the decomposed matrix.
Returns None
if the decomposed matrix is not invertible.
pub fn is_invertible(&self) -> bool
[src]
Indicates if the decomposed matrix is invertible.
pub fn determinant(&self) -> N
[src]
Computes the determinant of the decomposed matrix.
Trait Implementations
impl<N, R, C> Clone for FullPivLU<N, R, C> where
C: Dim + Clone,
N: Clone + ComplexField,
R: DimMin<C> + Clone,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
[src]
C: Dim + Clone,
N: Clone + ComplexField,
R: DimMin<C> + Clone,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
impl<N, R, C> Copy for FullPivLU<N, R, C> where
C: Dim,
N: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Copy,
PermutationSequence<<R as DimMin<C>>::Output>: Copy,
[src]
C: Dim,
N: ComplexField,
R: DimMin<C>,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Copy,
PermutationSequence<<R as DimMin<C>>::Output>: Copy,
impl<N, R, C> Debug for FullPivLU<N, R, C> where
C: Dim + Debug,
N: Debug + ComplexField,
R: DimMin<C> + Debug,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
[src]
C: Dim + Debug,
N: Debug + ComplexField,
R: DimMin<C> + Debug,
DefaultAllocator: Allocator<N, R, C>,
DefaultAllocator: Allocator<(usize, usize), <R as DimMin<C>>::Output, U1>,
Auto Trait Implementations
impl<N, R, C> !RefUnwindSafe for FullPivLU<N, R, C>
impl<N, R, C> !Send for FullPivLU<N, R, C>
impl<N, R, C> !Sync for FullPivLU<N, R, C>
impl<N, R, C> !Unpin for FullPivLU<N, R, C>
impl<N, R, C> !UnwindSafe for FullPivLU<N, R, C>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<V> IntoPnt<V> for V
[src]
impl<V> IntoVec<V> for V
[src]
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
[src]
fn is_in_subset(&self) -> bool
[src]
fn to_subset_unchecked(&self) -> SS
[src]
fn from_subset(element: &SS) -> SP
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,