A scalable parallel algorithm for incomplete factor preconditioning

From MaRDI portal





The paper deals with a parallel algorithm for computing incomplete factor preconditioners. It is shown that the algorithm attains a high degree of parallelism through graph partitioning and a two-level ordering strategy. Adequate experimental results are presented.




Cited in
(39)


Describes a project that uses

Uses Software






This page was built for publication: A scalable parallel algorithm for incomplete factor preconditioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719261)