Skip to main content

Module preconditioner

Module preconditioner 

Source
Expand description

Incomplete factorization preconditioners for iterative solvers.

Preconditioners approximate the inverse of a sparse matrix to accelerate iterative methods such as conjugate gradient (CG) and GMRES.

§Available preconditioners

  • ilu0 – Incomplete LU factorization with zero fill-in (ILU(0)). Suitable for general non-symmetric systems.
  • ic0 – Incomplete Cholesky factorization with zero fill-in (IC(0)). Suitable for symmetric positive-definite (SPD) systems.

Both preconditioners use a level-set parallel approach: rows are grouped into dependency levels, and all rows within a level are processed in parallel on the GPU.

Re-exports§

pub use graph_coloring::GraphColoring;
pub use ic0::ic0;
pub use ilu0::ilu0;
pub use iluk::IlukConfig;
pub use iluk::IlukFactorization;

Modules§

graph_coloring
Distance-2 graph coloring for parallel ILU/IC.
ic0
Incomplete Cholesky factorization with zero fill-in — IC(0).
ilu0
Incomplete LU factorization with zero fill-in — ILU(0).
iluk
ILU(k) – Incomplete LU factorization with k levels of fill-in.