No label defined (Q3703236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3930280 |
Statements
1985
0 references
sparse linear systems
0 references
finite differences
0 references
finite elements
0 references
Algebraic multigrid methods
0 references
complexity
0 references
convergence
0 references
comparison
0 references
0.8270646333694458
0 references
0.8223268389701843
0 references
0.8181378245353699
0 references
0.8109778165817261
0 references
0.8096461296081543
0 references
[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.
0 references