scientific article; zbMATH DE number 176182

From MaRDI portal
Publication:4035286





[For the entire collection see Zbl 0753.00013.] The author first gives a survey and summary of preconditioning methods, on systems arising from difference methods, before solving by conjugate gradients. He then numerically compares a number of algorithms; (1) basic conjugate gradients; (2) diagonal scaling; (3) ICCG(0) of \textit{J. A. Meijerink} and \textit{H. A. van der Vorst} [Math. Comput. 31, 148-162 (1977; Zbl 0349.65020)]; (4) `row sums equality' preconditioning of \textit{Y. S. Wong} [Iterative methods for problems in numerical analysis. Ph.D. Thesis, Oxford (1978)]; (5) strongly implicit procedure; (6)--(10) same with bi-conjugate gradients. The comparisons are on the finite difference Laplace equation on a uniform square mesh with Dirichlet, Neumann, or mixed boundary conditions.




Cited in
(23)








This page was built for publication:

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