Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions
From MaRDI portal
The author investigates how the computational performance of the conjugate gradient method changes when factorization is made more incomplete. Both two- and three-dimensional truncated factorization are treated, considering their performance for difference matrices. For two- dimensional problems the factorization which uses all nine bands has all in all the best performance. In three dimensions the orthogonal factorization method generally gives the best results.
Recommendations
Cites work
- A 3-D Poisson solver based on conjugate gradients compared to standard iterative methods and its performance on vector computers
- A class of first order factorization methods
- A Vectorizable Variant of some ICCG Methods
- Incomplete factorization methods for three-dimensional non-symmetric problems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
Cited in
(3)
This page was built for publication: Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111332)