Struct nalgebra::linalg::FullPivLU [−][src]
pub struct FullPivLU<N: Real, R: DimMin<C>, C: Dim> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>, { /* fields omitted */ }
LU decomposition with full row and column pivoting.
Methods
impl<N: Real, R: DimMin<C>, C: Dim> FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
[src]
impl<N: Real, R: DimMin<C>, C: Dim> FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
pub fn new(matrix: MatrixMN<N, R, C>) -> Self
[src]
pub fn new(matrix: MatrixMN<N, R, C>) -> Self
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) -> MatrixMN<N, R, DimMinimum<R, C>> where
DefaultAllocator: Allocator<N, R, DimMinimum<R, C>>,
[src]
pub fn l(&self) -> MatrixMN<N, R, DimMinimum<R, C>> where
DefaultAllocator: Allocator<N, R, DimMinimum<R, C>>,
The lower triangular matrix of this decomposition.
pub fn u(&self) -> MatrixMN<N, DimMinimum<R, C>, C> where
DefaultAllocator: Allocator<N, DimMinimum<R, C>, C>,
[src]
pub fn u(&self) -> MatrixMN<N, DimMinimum<R, C>, C> where
DefaultAllocator: Allocator<N, DimMinimum<R, C>, C>,
The upper triangular matrix of this decomposition.
pub fn p(&self) -> &PermutationSequence<DimMinimum<R, C>>
[src]
pub fn p(&self) -> &PermutationSequence<DimMinimum<R, C>>
The row permutations of this decomposition.
pub fn q(&self) -> &PermutationSequence<DimMinimum<R, C>>
[src]
pub fn q(&self) -> &PermutationSequence<DimMinimum<R, C>>
The column permutations of this decomposition.
pub fn unpack(
self
) -> (PermutationSequence<DimMinimum<R, C>>, MatrixMN<N, R, DimMinimum<R, C>>, MatrixMN<N, DimMinimum<R, C>, C>, PermutationSequence<DimMinimum<R, C>>) where
DefaultAllocator: Allocator<N, R, DimMinimum<R, C>> + Allocator<N, DimMinimum<R, C>, C>,
[src]
pub fn unpack(
self
) -> (PermutationSequence<DimMinimum<R, C>>, MatrixMN<N, R, DimMinimum<R, C>>, MatrixMN<N, DimMinimum<R, C>, C>, PermutationSequence<DimMinimum<R, C>>) where
DefaultAllocator: Allocator<N, R, DimMinimum<R, C>> + Allocator<N, DimMinimum<R, C>, C>,
The two matrices of this decomposition and the row and column permutations: (P, L, U, Q)
.
impl<N: Real, D: DimMin<D, Output = D>> FullPivLU<N, D, D> where
DefaultAllocator: Allocator<N, D, D> + Allocator<(usize, usize), D>,
[src]
impl<N: Real, D: DimMin<D, Output = D>> FullPivLU<N, D, D> where
DefaultAllocator: Allocator<N, D, D> + Allocator<(usize, usize), D>,
pub fn solve<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>> where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
DefaultAllocator: Allocator<N, R2, C2>,
[src]
pub fn solve<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>> where
S2: StorageMut<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.
Retuns None
if the decomposed matrix is not invertible.
pub fn solve_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> bool where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]
pub fn solve_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> bool where
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<MatrixN<N, D>>
[src]
pub fn try_inverse(&self) -> Option<MatrixN<N, D>>
Computes the inverse of the decomposed matrix.
Returns None
if the decomposed matrix is not invertible.
pub fn is_invertible(&self) -> bool
[src]
pub fn is_invertible(&self) -> bool
Indicates if the decomposed matrix is invertible.
pub fn determinant(&self) -> N
[src]
pub fn determinant(&self) -> N
Computes the determinant of the decomposed matrix.
Trait Implementations
impl<N: Clone + Real, R: Clone + DimMin<C>, C: Clone + Dim> Clone for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
[src]
impl<N: Clone + Real, R: Clone + DimMin<C>, C: Clone + Dim> Clone for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
fn clone(&self) -> FullPivLU<N, R, C>
[src]
fn clone(&self) -> FullPivLU<N, R, C>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
impl<N: Debug + Real, R: Debug + DimMin<C>, C: Debug + Dim> Debug for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
[src]
impl<N: Debug + Real, R: Debug + DimMin<C>, C: Debug + Dim> Debug for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<N: Real, R: DimMin<C>, C: Dim> Copy for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
MatrixMN<N, R, C>: Copy,
PermutationSequence<DimMinimum<R, C>>: Copy,
[src]
impl<N: Real, R: DimMin<C>, C: Dim> Copy for FullPivLU<N, R, C> where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
MatrixMN<N, R, C>: Copy,
PermutationSequence<DimMinimum<R, C>>: Copy,