Struct ndarray_linalg::solve::LUFactorized [−][src]
Represents the LU factorization of a matrix A
as A = P*L*U
.
Fields
a: ArrayBase<S, Ix2>
The factors L
and U
; the unit diagonal elements of L
are not
stored.
ipiv: Pivot
The pivot indices that define the permutation matrix P
.
Trait Implementations
impl<S: Clone + Data + RawDataClone> Clone for LUFactorized<S>
[src]
fn clone(&self) -> LUFactorized<S>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<A, S> Determinant<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
[src]
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,
[src]
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> Inverse for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
[src]
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
impl<A, S> InverseInto for LUFactorized<S> where
A: Scalar + Lapack,
S: DataMut<Elem = A> + RawDataClone,
[src]
A: Scalar + Lapack,
S: DataMut<Elem = A> + RawDataClone,
impl<A, S> ReciprocalConditionNum<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
[src]
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,
[src]
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
fn rcond_into(self) -> Result<A::Real>
[src]
impl<A, S> Solve<A> for LUFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
[src]
A: Scalar + Lapack,
S: Data<Elem = A> + RawDataClone,
fn solve_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
[src]
&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>,
[src]
&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>,
[src]
&self,
rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
fn solve<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>
[src]
fn solve_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
[src]
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
fn solve_t<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>
[src]
fn solve_t_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
[src]
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
fn solve_h<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>
[src]
fn solve_h_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
[src]
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
Auto Trait Implementations
impl<S> RefUnwindSafe for LUFactorized<S> where
S: RefUnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
S: RefUnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
impl<S> Send for LUFactorized<S> where
S: Send,
S: Send,
impl<S> Sync for LUFactorized<S> where
S: Sync,
S: Sync,
impl<S> Unpin for LUFactorized<S> where
S: Unpin,
S: Unpin,
impl<S> UnwindSafe for LUFactorized<S> where
S: UnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
S: UnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
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,
pub 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<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub 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.
pub 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.
pub 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>,