Struct lax::tridiagonal::LUFactorizedTridiagonal

pub struct LUFactorizedTridiagonal<A: Scalar> {
    pub a: Tridiagonal<A>,
    pub du2: Vec<A>,
    pub ipiv: Pivot,
    pub a_opnorm_one: A::Real,
}

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: Pivot

The pivot indices that define the permutation matrix P.

a_opnorm_one: A::Real

Trait Implementations

impl<A: Clone + Scalar> Clone for LUFactorizedTridiagonal<A>

where A::Real: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: PartialEq + Scalar> PartialEq for LUFactorizedTridiagonal<A>

where A::Real: PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

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

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