Struct Tridiagonal 

pub struct Tridiagonal<'a> { /* private fields */ }

A tridiagonal matrix representation

Implementations

impl<'a> Tridiagonal<'a>

pub fn new( dl: &'a [f64], d: &'a [f64], du: &'a [f64], ) -> Result<Tridiagonal<'a>, LoxTridiagonalError>

Creates a new tridiagonal matrix from lower, main, and upper diagonals.

pub fn shape(&self) -> (usize, usize)

Returns the shape (n, n) of the matrix.

pub fn solve(&self, d: &[f64]) -> Vec<f64>

Solves the tridiagonal system Ax = d using the Thomas algorithm.

Trait Implementations

impl<'a> Clone for Tridiagonal<'a>

fn clone(&self) -> Tridiagonal<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for Tridiagonal<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Index<(usize, usize)> for Tridiagonal<'_>

type Output = f64

The returned type after indexing.

fn index( &self, _: (usize, usize), ) -> &<Tridiagonal<'_> as Index<(usize, usize)>>::Output

Performs the indexing (container[index]) operation.

impl<'a> 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> StructuralPartialEq for Tridiagonal<'a>