Struct ILU0Preconditioner 

pub struct ILU0Preconditioner<F> { /* private fields */ }

Incomplete LU factorization with zero fill-in (ILU(0))

This preconditioner computes an incomplete LU factorization where L and U have the same sparsity pattern as the original matrix.

Implementations

impl<F: Float + NumAssign + Sum + Debug + SparseElement + 'static> ILU0Preconditioner<F>

pub fn new(matrix: &CsrMatrix<F>) -> SparseResult<Self>

Create a new ILU(0) preconditioner

Trait Implementations

impl<F: Float + NumAssign + Sum + Debug + SparseElement + 'static> LinearOperator<F> for ILU0Preconditioner<F>

fn shape(&self) -> (usize, usize)

The shape of the operator (rows, columns)

fn matvec(&self, x: &[F]) -> SparseResult<Vec<F>>

Apply the operator to a vector: y = A * x

fn has_adjoint(&self) -> bool

Check if the operator supports adjoint operations

fn matmat(&self, x: &[Vec<F>]) -> SparseResult<Vec<Vec<F>>>

Apply the operator to a matrix: Y = A * X where X is column-major (each column is a vector)

fn rmatvec(&self, x: &[F]) -> SparseResult<Vec<F>>

Apply the adjoint of the operator to a vector: y = A^H * x Default implementation returns an error

fn rmatmat(&self, x: &[Vec<F>]) -> SparseResult<Vec<Vec<F>>>

Apply the adjoint of the operator to a matrix: Y = A^H * X Default implementation calls rmatvec for each column