Skip to main content

LuDecompositionF32

Struct LuDecompositionF32 

Source
pub struct LuDecompositionF32 { /* private fields */ }
Expand description

Compact LU factorization in column-major layout.

Implementations§

Source§

impl LuDecompositionF32

Source

pub fn factors(&self) -> &[f32]

Examples found in repository?
examples/05_lapack_decompositions.rs (line 8)
3fn main() {
4    // Column-major 2x2 matrix [[3, 1], [1, 2]].
5    let matrix = [3.0_f32, 1.0, 1.0, 2.0];
6    let lu = lu_decompose_f32(&matrix, 2).expect("lu");
7    assert_eq!(lu.dimension(), 2);
8    assert_eq!(lu.factors().len(), 4);
9
10    let solution = solve_linear_system_f32(&matrix, 2, &[9.0_f32, 8.0]).expect("solve");
11    assert!((solution[0] - 2.0).abs() < 1.0e-5);
12    assert!((solution[1] - 3.0).abs() < 1.0e-5);
13
14    println!(
15        "lapack smoke passed: pivots={:?} solution={solution:?}",
16        lu.pivots()
17    );
18}
Source

pub fn pivots(&self) -> &[i32]

Examples found in repository?
examples/05_lapack_decompositions.rs (line 16)
3fn main() {
4    // Column-major 2x2 matrix [[3, 1], [1, 2]].
5    let matrix = [3.0_f32, 1.0, 1.0, 2.0];
6    let lu = lu_decompose_f32(&matrix, 2).expect("lu");
7    assert_eq!(lu.dimension(), 2);
8    assert_eq!(lu.factors().len(), 4);
9
10    let solution = solve_linear_system_f32(&matrix, 2, &[9.0_f32, 8.0]).expect("solve");
11    assert!((solution[0] - 2.0).abs() < 1.0e-5);
12    assert!((solution[1] - 3.0).abs() < 1.0e-5);
13
14    println!(
15        "lapack smoke passed: pivots={:?} solution={solution:?}",
16        lu.pivots()
17    );
18}
Source

pub const fn dimension(&self) -> usize

Examples found in repository?
examples/05_lapack_decompositions.rs (line 7)
3fn main() {
4    // Column-major 2x2 matrix [[3, 1], [1, 2]].
5    let matrix = [3.0_f32, 1.0, 1.0, 2.0];
6    let lu = lu_decompose_f32(&matrix, 2).expect("lu");
7    assert_eq!(lu.dimension(), 2);
8    assert_eq!(lu.factors().len(), 4);
9
10    let solution = solve_linear_system_f32(&matrix, 2, &[9.0_f32, 8.0]).expect("solve");
11    assert!((solution[0] - 2.0).abs() < 1.0e-5);
12    assert!((solution[1] - 3.0).abs() < 1.0e-5);
13
14    println!(
15        "lapack smoke passed: pivots={:?} solution={solution:?}",
16        lu.pivots()
17    );
18}

Trait Implementations§

Source§

impl Clone for LuDecompositionF32

Source§

fn clone(&self) -> LuDecompositionF32

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for LuDecompositionF32

Source§

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

Formats the value using the given formatter. Read more
Source§

impl PartialEq for LuDecompositionF32

Source§

fn eq(&self, other: &LuDecompositionF32) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · 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 StructuralPartialEq for LuDecompositionF32

Auto Trait Implementations§

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, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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.