Struct ndarray_linalg::solve::LUFactorized
source · [−]pub struct LUFactorized<S: Data + RawDataClone> { /* private fields */ }
Expand description
Represents the LU factorization of a matrix A
as A = P*L*U
.
Trait Implementations
sourceimpl<S: Clone + Data + RawDataClone> Clone for LUFactorized<S>
impl<S: Clone + Data + RawDataClone> Clone for LUFactorized<S>
sourcefn clone(&self) -> LUFactorized<S>
fn clone(&self) -> LUFactorized<S>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<A, S> Determinant<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> Determinant<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourceimpl<A, S> DeterminantInto<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> DeterminantInto<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourceimpl<A, S> Inverse for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> Inverse for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourceimpl<A, S> InverseInto for LUFactorized<S> where
A: Scalar + Lapack,
S: DataMut<Elem = A> + RawDataClone,
impl<A, S> InverseInto for LUFactorized<S> where
A: Scalar + Lapack,
S: DataMut<Elem = A> + RawDataClone,
sourceimpl<A, S> ReciprocalConditionNum<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> ReciprocalConditionNum<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourceimpl<A, S> ReciprocalConditionNumInto<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> ReciprocalConditionNumInto<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourcefn rcond_into(self) -> Result<A::Real>
fn rcond_into(self) -> Result<A::Real>
Estimates the reciprocal of the condition number of the matrix in 1-norm. Read more
sourceimpl<A, S> Solve<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> Solve<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
sourcefn solve_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
fn solve_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> 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 more
sourcefn solve_t_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
fn solve_t_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> 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 more
sourcefn solve_h_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
fn solve_h_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> 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 more
sourcefn solve<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>
fn solve<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<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 more
sourcefn solve_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
fn solve_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
Solves a system of linear equations A * x = b
where A
is self
, b
is the argument, and x
is the successful result. Read more
sourcefn solve_t<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>
fn solve_t<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<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 more
sourcefn solve_t_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
fn solve_t_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
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 more
Auto Trait Implementations
impl<S> RefUnwindSafe for LUFactorized<S> where
S: RefUnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
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> where
S: UnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
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