Trait lax::Solve_

pub trait Solve_: Scalar + Sized {
    fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>;
    fn inv(l: MatrixLayout, a: &mut [Self], p: &Pivot) -> Result<()>;
    fn solve(
        l: MatrixLayout,
        t: Transpose,
        a: &[Self],
        p: &Pivot,
        b: &mut [Self]
    ) -> Result<()>;
}

Required Methods

fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>

Computes the LU factorization of a general m x n matrix a using partial pivoting with row interchanges.

$ PA = LU $

Error

• LapackComputationalFailure { return_code } when the matrix is singular
  • Division by zero will occur if it is used to solve a system of equations because U[(return_code-1, return_code-1)] is exactly zero.

fn inv(l: MatrixLayout, a: &mut [Self], p: &Pivot) -> Result<()>

fn solve(
    l: MatrixLayout,
    t: Transpose,
    a: &[Self],
    p: &Pivot,
    b: &mut [Self]
) -> Result<()>

Implementations on Foreign Types

impl Solve_ for f64

fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>

fn inv(l: MatrixLayout, a: &mut [Self], ipiv: &Pivot) -> Result<()>

fn solve(
    l: MatrixLayout,
    t: Transpose,
    a: &[Self],
    ipiv: &Pivot,
    b: &mut [Self]
) -> Result<()>

impl Solve_ for f32

fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>

fn inv(l: MatrixLayout, a: &mut [Self], ipiv: &Pivot) -> Result<()>

fn solve(
    l: MatrixLayout,
    t: Transpose,
    a: &[Self],
    ipiv: &Pivot,
    b: &mut [Self]
) -> Result<()>

impl Solve_ for c64

fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>

fn inv(l: MatrixLayout, a: &mut [Self], ipiv: &Pivot) -> Result<()>

fn solve(
    l: MatrixLayout,
    t: Transpose,
    a: &[Self],
    ipiv: &Pivot,
    b: &mut [Self]
) -> Result<()>

impl Solve_ for c32

fn lu(l: MatrixLayout, a: &mut [Self]) -> Result<Pivot>

fn inv(l: MatrixLayout, a: &mut [Self], ipiv: &Pivot) -> Result<()>

fn solve(
    l: MatrixLayout,
    t: Transpose,
    a: &[Self],
    ipiv: &Pivot,
    b: &mut [Self]
) -> Result<()>

Implementors