scientific article; zbMATH DE number 3930280

From MaRDI portal
Publication:3703236





[For the entire collection see Zbl 0563.00017.] Algebraic multigrid methods are used as genuine black box solvers for elliptic partial differential equations discretized by finite differences or finite elements. In this purpose a code (AMGO1) was presented by the second author [Appl. Math. Comput. 13, 419-451 (1983; Zbl 0533.65064)]. Striving after higher efficiency the present paper reports on the further development of that code. The restrictions stipulated on the sparse coefficient matrix are its symmetry, that the sum of each column is \(\geq 0\), and that all off-diagonal coefficients are \(\leq 0\). However, the code frequently seems to work also in cases where these assumptions are violated. The improved algorithm is introduced in detail. In a number of test problems its complexity, convergence, and running time are compared with corresponding data of the older code and of some geometric multigrid solvers. This comparison shows that it is quite attractive for its efficiency and ability to solve general problems with no regular geometric structure. The price for this convenience is paid in terms of setup time and storage.




Cited in
(39)








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 Q3703236)