pub struct LUFactorized<S>where
S: Data + RawDataClone,{ /* private fields */ }Expand description
Represents the LU factorization of a matrix A as A = P*L*U.
Trait Implementations§
Source§impl<S> Clone for LUFactorized<S>
impl<S> Clone for LUFactorized<S>
Source§fn clone(&self) -> LUFactorized<S>
fn clone(&self) -> LUFactorized<S>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<A, S> Determinant<A> for LUFactorized<S>
impl<A, S> Determinant<A> for LUFactorized<S>
Source§impl<A, S> DeterminantInto<A> for LUFactorized<S>
impl<A, S> DeterminantInto<A> for LUFactorized<S>
Source§fn sln_det_into(self) -> Result<(A, <A as Scalar>::Real), LinalgError>
fn sln_det_into(self) -> Result<(A, <A as Scalar>::Real), LinalgError>
Computes the
(sign, natural_log) of the determinant of the matrix. Read moreSource§fn det_into(self) -> Result<A, LinalgError>
fn det_into(self) -> Result<A, LinalgError>
Computes the determinant of the matrix.
Source§impl<A, S> Inverse for LUFactorized<S>
impl<A, S> Inverse for LUFactorized<S>
Source§impl<A, S> InverseInto for LUFactorized<S>
impl<A, S> InverseInto for LUFactorized<S>
Source§impl<A, S> ReciprocalConditionNum<A> for LUFactorized<S>
impl<A, S> ReciprocalConditionNum<A> for LUFactorized<S>
Source§impl<A, S> ReciprocalConditionNumInto<A> for LUFactorized<S>
impl<A, S> ReciprocalConditionNumInto<A> for LUFactorized<S>
Source§fn rcond_into(self) -> Result<<A as Scalar>::Real, LinalgError>
fn rcond_into(self) -> Result<<A as Scalar>::Real, LinalgError>
Estimates the reciprocal of the condition number of the matrix in
1-norm. Read more
Source§impl<A, S> Solve<A> for LUFactorized<S>
impl<A, S> Solve<A> for LUFactorized<S>
Source§fn solve_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
fn solve_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
Solves a system of linear equations
A * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve_t_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
fn solve_t_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
Solves a system of linear equations
A^T * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve_h_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
fn solve_h_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
Solves a system of linear equations
A^H * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
fn solve<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
Solves a system of linear equations
A * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
fn solve_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
Solves a system of linear equations
A * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve_t<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
fn solve_t<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
Solves a system of linear equations
A^T * x = b where A is self, b
is the argument, and x is the successful result. Read moreSource§fn solve_t_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
fn solve_t_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
Solves a system of linear equations
A^T * x = b where A is self, b
is the argument, and x is the successful result. Read moreAuto Trait Implementations§
impl<S> Freeze for LUFactorized<S>where
S: Freeze,
impl<S> RefUnwindSafe for LUFactorized<S>
impl<S> Send for LUFactorized<S>where
S: Send,
impl<S> Sync for LUFactorized<S>where
S: Sync,
impl<S> Unpin for LUFactorized<S>where
S: Unpin,
impl<S> UnwindSafe for LUFactorized<S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn 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 moreSource§fn 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).Source§fn 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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.