On parallelism and convergence of incomplete LU factorizations

From MaRDI portal





This paper contains numerical experiments whose aim is to determine how the degree of parallelism affects the convergence speed of preconditioned conjugate gradients, when applied to solve linear systems that arise from five point discretization of two-dimensional elliptic problems. One of the main conclusions is that certain orderings of the nodes that are better suited for parallelization lead to poorer convergence.




Cited in
(19)








This page was built for publication: On parallelism and convergence of incomplete LU factorizations

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