Struct NaiveDense 

pub struct NaiveDense;

Reference kernels: straightforward loops, always available, the oracle of the others in tests.

use xingo_sparse::{DenseBlock, DenseKernel, NaiveDense};
let mut a = DenseBlock { rows: 2, cols: 2, data: vec![4.0, 2.0, 0.0, 5.0] };
NaiveDense.potrf(&mut a).unwrap();
assert_eq!((a.get(0, 0), a.get(1, 0), a.get(1, 1)), (2.0, 1.0, 2.0));

Trait Implementations

impl Clone for NaiveDense

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NaiveDense

impl Debug for NaiveDense

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

Formats the value using the given formatter.

impl Default for NaiveDense

fn default() -> Self

Returns the “default value” for a type.

impl<T: Real> DenseKernel<T> for NaiveDense

fn potrf(&self, a: &mut DenseBlock<T>) -> Result<(), DenseError>

In-place Cholesky A = L Lᵀ of a square block (Algorithm P).

fn sytrf( &self, a: &mut DenseBlock<T>, perm: &mut Perm, pivot_2x2: &mut Vec<bool>, ) -> Result<Inertia, DenseError>

In-place P A Pᵀ = L B Lᵀ with 1×1/2×2 pivots (Bunch–Kaufman, Algorithm B); returns the inertia and writes the permutation into perm and the 2×2 marks into pivot_2x2 (both resized to n).

fn trsm_lower(&self, l: &DenseBlock<T>, b: &mut DenseBlock<T>, transpose: bool)

B ← B L⁻ᵀ (transpose = true) or B ← L⁻¹ B (false), L square, non-unit lower triangular.

fn gemm_sub(&self, a: &DenseBlock<T>, b: &DenseBlock<T>, c: &mut DenseBlock<T>)

C ← C − A Bᵀ.

fn syrk_sub(&self, a: &DenseBlock<T>, c: &mut DenseBlock<T>)

C ← C − A Aᵀ, lower triangle of C.

fn name(&self) -> &'static str

A short name for logs and tables.

impl Eq for NaiveDense

impl PartialEq for NaiveDense

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NaiveDense