pub struct DdDense;Expand description
The dense kernel of xingo-sparse for double-double blocks, with the
results of NaiveDense bit for bit (Chapter 11.7): gemm_sub,
syrk_sub and the triangular solves run the column update of
crate::kernels::gemm_sub on SIMD registers (feature simd), and
so does potrf (left-looking since xingo-sparse 0.4.0); sytrf is
that of NaiveDense. With it
SupernodalLdl<DoubleDouble, DdDense> spends its time in SIMD.
use xingo_extprec::{DdDense, DoubleDouble};
use xingo_sparse::{DenseBlock, DenseKernel, NaiveDense};
let third = DoubleDouble::ONE / 3.0;
let a = DenseBlock { rows: 2, cols: 1, data: vec![third, DoubleDouble::ONE] };
let mut c = DenseBlock { rows: 2, cols: 2, data: vec![DoubleDouble::ONE; 4] };
let mut d = c.clone();
DdDense.syrk_sub(&a, &mut c);
NaiveDense.syrk_sub(&a, &mut d);
assert_eq!(c, d);Trait Implementations§
impl Copy for DdDense
Source§impl DenseKernel<DoubleDouble> for DdDense
impl DenseKernel<DoubleDouble> for DdDense
Source§fn potrf(&self, a: &mut DenseBlock<DoubleDouble>) -> Result<(), DenseError>
fn potrf(&self, a: &mut DenseBlock<DoubleDouble>) -> Result<(), DenseError>
In-place Cholesky
A = L Lᵀ of a square block (Algorithm P).Source§fn sytrf(
&self,
a: &mut DenseBlock<DoubleDouble>,
perm: &mut Perm,
pivot_2x2: &mut Vec<bool>,
) -> Result<Inertia, DenseError>
fn sytrf( &self, a: &mut DenseBlock<DoubleDouble>, 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).Source§fn trsm_lower(
&self,
l: &DenseBlock<DoubleDouble>,
b: &mut DenseBlock<DoubleDouble>,
transpose: bool,
)
fn trsm_lower( &self, l: &DenseBlock<DoubleDouble>, b: &mut DenseBlock<DoubleDouble>, transpose: bool, )
Source§fn gemm_sub(
&self,
a: &DenseBlock<DoubleDouble>,
b: &DenseBlock<DoubleDouble>,
c: &mut DenseBlock<DoubleDouble>,
)
fn gemm_sub( &self, a: &DenseBlock<DoubleDouble>, b: &DenseBlock<DoubleDouble>, c: &mut DenseBlock<DoubleDouble>, )
C ← C − A Bᵀ. Read moreSource§fn syrk_sub(
&self,
a: &DenseBlock<DoubleDouble>,
c: &mut DenseBlock<DoubleDouble>,
)
fn syrk_sub( &self, a: &DenseBlock<DoubleDouble>, c: &mut DenseBlock<DoubleDouble>, )
Source§fn solve_min_rows(&self) -> usize
fn solve_min_rows(&self) -> usize
The smallest row count
n_r of a supernode block for which the
solves of SupernodalLdl go through this kernel (gather, hook,
scatter; step S0′ of Chapter 5.17). usize::MAX — the default —
keeps the loops of the second edition everywhere. A cost switch
only (invariant (D5)).Source§fn solve_unit_lower(
&self,
l: &DenseBlock<DoubleDouble>,
skip: &[bool],
y: &mut [DoubleDouble],
)
fn solve_unit_lower( &self, l: &DenseBlock<DoubleDouble>, skip: &[bool], y: &mut [DoubleDouble], )
Forward half of a supernode’s solve,
y ← L⁻¹ y (Algorithm V).
l is the stored block (rows ≥ cols, unit lower trapezoidal,
diagonal slots ignored); skip is empty or has l.cols marks (the
first column of each 2×2 pivot). Read moreSource§fn solve_unit_lower_t(
&self,
l: &DenseBlock<DoubleDouble>,
skip: &[bool],
y: &mut [DoubleDouble],
)
fn solve_unit_lower_t( &self, l: &DenseBlock<DoubleDouble>, skip: &[bool], y: &mut [DoubleDouble], )
Backward half,
y_{..cols} ← L₁₁⁻ᵀ (y_{..cols} − L₂₁ᵀ y_{cols..})
(Algorithm W); y[cols..] is read only. Read moreAuto Trait Implementations§
impl Freeze for DdDense
impl RefUnwindSafe for DdDense
impl Send for DdDense
impl Sync for DdDense
impl Unpin for DdDense
impl UnsafeUnpin for DdDense
impl UnwindSafe for DdDense
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more