Struct lax::tridiagonal::Tridiagonal

pub struct Tridiagonal<A: Scalar> {
    pub l: MatrixLayout,
    pub dl: Vec<A>,
    pub d: Vec<A>,
    pub du: Vec<A>,
}

Represents a tridiagonal matrix as 3 one-dimensional vectors.

[d0, u1,  0,   ...,       0,
 l1, d1, u2,            ...,
  0, l2, d2,
 ...           ...,  u{n-1},
  0,  ...,  l{n-1},  d{n-1},]

Fields

l: MatrixLayout

layout of raw matrix

dl: Vec<A>

(n-1) sub-diagonal elements of matrix.

d: Vec<A>

(n) diagonal elements of matrix.

du: Vec<A>

(n-1) super-diagonal elements of matrix.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Scalar> Index<[i32; 2]> for Tridiagonal<A>

type Output = A

The returned type after indexing.

fn index(&self, [row, col]: [i32; 2]) -> &A

Performs the indexing (container[index]) operation.

impl<A: Scalar> Index<(i32, i32)> for Tridiagonal<A>

type Output = A

The returned type after indexing.

fn index(&self, (row, col): (i32, i32)) -> &A

Performs the indexing (container[index]) operation.

impl<A: Scalar> IndexMut<[i32; 2]> for Tridiagonal<A>

fn index_mut(&mut self, [row, col]: [i32; 2]) -> &mut A

Performs the mutable indexing (container[index]) operation.

impl<A: Scalar> IndexMut<(i32, i32)> for Tridiagonal<A>

fn index_mut(&mut self, (row, col): (i32, i32)) -> &mut A

Performs the mutable indexing (container[index]) operation.

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

fn eq(&self, other: &Tridiagonal<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: Eq + Scalar> Eq for Tridiagonal<A>

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