Struct Ict 

pub struct Ict<I, T> { /* private fields */ }

Numeric ICT factor of a Hermitian positive-definite CSC matrix A.

Stores the lower-triangular factor L (diagonal first per column) such that L L^H ~= A. Apply uses the same two triangular solves as crate::Ic0.

Implementations

impl<I: Index, T: ComplexField> Ict<I, T>

pub fn try_new(a: SparseColMatRef<'_, I, T>) -> Result<Self, IctError>

Build an ICT factor with the default parameters.

pub fn try_new_with_params( a: SparseColMatRef<'_, I, T>, params: IctParams, ) -> Result<Self, IctError>

Build an ICT factor with explicit parameters.

Only the lower triangle of A is read.

Errors

• IctError::NonSquareMatrix if A is not square.
• IctError::InvalidDropTol / IctError::InvalidFillControl for bad parameters.
• IctError::NotPositiveDefinite if a non-positive pivot appears.

pub fn refactorize( &mut self, a: SparseColMatRef<'_, I, T>, ) -> Result<(), IctError>

Refactorise against a new matrix with the same dimension.

Reuses the existing buffer capacity but, because the pattern is value- dependent, recomputes it from scratch — this is not allocation-free in the strict sense (it may grow the buffers).

Errors

As Ict::try_new_with_params, plus IctError::PatternMismatch if a’s dimension differs.

pub fn dim(&self) -> usize

Dimension n of the factored matrix.

pub fn l_view(&self) -> SparseColMatRef<'_, I, T>

View over the lower-triangular factor L (diagonal first per column).

Trait Implementations

impl<I, T> BiLinOp<T> for Ict<I, T>

where I: Index, T: ComplexField + Debug + Sync,

fn transpose_apply_scratch(&self, _rhs_ncols: usize, _par: Par) -> StackReq

computes the workspace layout required to apply the transpose or adjoint o self to a matrix with rhs_ncols columns

fn transpose_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, _stack: &mut MemStack, )

applies the transpose of self to rhs, and stores the result in out

fn adjoint_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, _stack: &mut MemStack, )

applies the adjoint of self to rhs, and stores the result in out

impl<I, T> BiPrecond<T> for Ict<I, T>

where I: Index, T: ComplexField + Debug + Sync,

fn transpose_apply_in_place_scratch( &self, _rhs_ncols: usize, _par: Par, ) -> StackReq

computes the workspace layout required to apply the transpose or adjoint of self to a matrix with rhs_ncols columns in place

fn transpose_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, _stack: &mut MemStack, )

applies the transpose of self to rhs, and stores the result in rhs

fn adjoint_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, _stack: &mut MemStack, )

applies the adjoint of self to rhs, and stores the result in rhs

impl<I: Clone, T: Clone> Clone for Ict<I, T>

fn clone(&self) -> Ict<I, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug, T: Debug> Debug for Ict<I, T>

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

Formats the value using the given formatter.

impl<I, T> LinOp<T> for Ict<I, T>

where I: Index, T: ComplexField + Debug + Sync,

fn apply_scratch(&self, _rhs_ncols: usize, _par: Par) -> StackReq

computes the workspace layout required to apply self or the conjugate o self to a matrix with rhs_ncols columns

fn nrows(&self) -> usize

output dimension of the operator

fn ncols(&self) -> usize

input dimension of the operator

fn apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, _stack: &mut MemStack, )

applies self to rhs, and stores the result in out

fn conj_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, _stack: &mut MemStack, )

applies the conjugate of self to rhs, and stores the result in out

impl<I, T> Precond<T> for Ict<I, T>

where I: Index, T: ComplexField + Debug + Sync,

fn apply_in_place_scratch(&self, _rhs_ncols: usize, _par: Par) -> StackReq

computes the workspace layout required to apply self or the conjugate of self to a matrix with rhs_ncols columns in place

fn apply_in_place(&self, rhs: MatMut<'_, T>, par: Par, _stack: &mut MemStack)

applies self to rhs, and stores the result in rhs

fn conj_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, _stack: &mut MemStack, )

applies the conjugate of self to rhs, and stores the result in rhs