ndarray_linalg::tridiagonal

Struct LUFactorizedTridiagonal

source
pub struct LUFactorizedTridiagonal<A>
where A: Scalar,
{ pub a: Tridiagonal<A>, pub du2: Vec<A>, pub ipiv: Vec<i32>, pub a_opnorm_one: <A as Scalar>::Real, }
Expand description

Represents the LU factorization of a tridiagonal matrix A as A = P*L*U.

Fields§

§a: Tridiagonal<A>

A tridiagonal matrix which consists of

  • l : layout of raw matrix
  • dl: (n-1) multipliers that define the matrix L.
  • d : (n) diagonal elements of the upper triangular matrix U.
  • du: (n-1) elements of the first super-diagonal of U.
§du2: Vec<A>

(n-2) elements of the second super-diagonal of U.

§ipiv: Vec<i32>

The pivot indices that define the permutation matrix P.

§a_opnorm_one: <A as Scalar>::Real

Trait Implementations§

source§

impl<A> Clone for LUFactorizedTridiagonal<A>
where A: Clone + Scalar, <A as Scalar>::Real: Clone,

source§

fn clone(&self) -> LUFactorizedTridiagonal<A>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<A> PartialEq for LUFactorizedTridiagonal<A>
where A: PartialEq + Scalar, <A as Scalar>::Real: PartialEq,

source§

fn eq(&self, other: &LUFactorizedTridiagonal<A>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<A> ReciprocalConditionNumTridiagonal<A> for LUFactorizedTridiagonal<A>
where A: Scalar + Lapack,

source§

fn rcond_tridiagonal(&self) -> Result<A::Real>

Estimates the reciprocal of the condition number of the tridiagonal matrix in 1-norm. Read more
source§

impl<A> ReciprocalConditionNumTridiagonalInto<A> for LUFactorizedTridiagonal<A>
where A: Scalar + Lapack,

source§

fn rcond_tridiagonal_into(self) -> Result<A::Real>

Estimates the reciprocal of the condition number of the tridiagonal matrix in 1-norm. Read more
source§

impl<A> SolveTridiagonal<A, Dim<[usize; 1]>> for LUFactorizedTridiagonal<A>
where A: Scalar + Lapack,

source§

fn solve_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix1>, ) -> Result<Array<A, Ix1>>

Solves a system of linear equations A * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix1>, ) -> Result<ArrayBase<S, Ix1>>

Solves a system of linear equations A * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_t_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix1>, ) -> Result<Array<A, Ix1>>

Solves a system of linear equations A^T * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_t_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix1>, ) -> Result<ArrayBase<S, Ix1>>

Solves a system of linear equations A^T * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_h_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix1>, ) -> Result<Array<A, Ix1>>

Solves a system of linear equations A^H * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_h_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix1>, ) -> Result<ArrayBase<S, Ix1>>

Solves a system of linear equations A^H * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

impl<A> SolveTridiagonal<A, Dim<[usize; 2]>> for LUFactorizedTridiagonal<A>
where A: Scalar + Lapack,

source§

fn solve_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix2>, ) -> Result<Array<A, Ix2>>

Solves a system of linear equations A * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix2>, ) -> Result<ArrayBase<S, Ix2>>

Solves a system of linear equations A * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_t_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix2>, ) -> Result<Array<A, Ix2>>

Solves a system of linear equations A^T * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_t_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix2>, ) -> Result<ArrayBase<S, Ix2>>

Solves a system of linear equations A^T * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_h_tridiagonal<S: Data<Elem = A>>( &self, b: &ArrayBase<S, Ix2>, ) -> Result<Array<A, Ix2>>

Solves a system of linear equations A^H * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

fn solve_h_tridiagonal_into<S: DataMut<Elem = A>>( &self, b: ArrayBase<S, Ix2>, ) -> Result<ArrayBase<S, Ix2>>

Solves a system of linear equations A^H * x = b with tridiagonal matrix A, where A is self, b is the argument, and x is the successful result.
source§

impl<A> SolveTridiagonalInplace<A, Dim<[usize; 2]>> for LUFactorizedTridiagonal<A>
where A: Scalar + Lapack,

source§

fn solve_tridiagonal_inplace<'a, Sb>( &self, rhs: &'a mut ArrayBase<Sb, Ix2>, ) -> Result<&'a mut ArrayBase<Sb, Ix2>>
where Sb: DataMut<Elem = A>,

Solves a system of linear equations A * x = b tridiagonal matrix A, where A is self, b is the argument, and x is the successful result. The value of x is also assigned to the argument.
source§

fn solve_t_tridiagonal_inplace<'a, Sb>( &self, rhs: &'a mut ArrayBase<Sb, Ix2>, ) -> Result<&'a mut ArrayBase<Sb, Ix2>>
where Sb: DataMut<Elem = A>,

Solves a system of linear equations A^T * x = b tridiagonal matrix A, where A is self, b is the argument, and x is the successful result. The value of x is also assigned to the argument.
source§

fn solve_h_tridiagonal_inplace<'a, Sb>( &self, rhs: &'a mut ArrayBase<Sb, Ix2>, ) -> Result<&'a mut ArrayBase<Sb, Ix2>>
where Sb: DataMut<Elem = A>,

Solves a system of linear equations A^H * x = b tridiagonal matrix A, where A is self, b is the argument, and x is the successful result. The value of x is also assigned to the argument.
source§

impl<A> StructuralPartialEq for LUFactorizedTridiagonal<A>
where A: Scalar,

Auto Trait Implementations§

§

impl<A> Freeze for LUFactorizedTridiagonal<A>
where <A as Scalar>::Real: Freeze,

§

impl<A> RefUnwindSafe for LUFactorizedTridiagonal<A>

§

impl<A> Send for LUFactorizedTridiagonal<A>
where <A as Scalar>::Real: Send, A: Send,

§

impl<A> Sync for LUFactorizedTridiagonal<A>
where <A as Scalar>::Real: Sync, A: Sync,

§

impl<A> Unpin for LUFactorizedTridiagonal<A>
where <A as Scalar>::Real: Unpin, A: Unpin,

§

impl<A> UnwindSafe for LUFactorizedTridiagonal<A>
where <A as Scalar>::Real: UnwindSafe, A: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V