Application of the AGE algorithm to the SLOR and ADI methods (Q1097002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1097002 |
scientific article; zbMATH DE number 4032912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Application of the AGE algorithm to the SLOR and ADI methods |
scientific article; zbMATH DE number 4032912 |
Statements
Application of the AGE algorithm to the SLOR and ADI methods (English)
0 references
1987
0 references
The alternating group explicit (AGE) algorithm for solving tridiagonal systems of equations is applied to the SLOR and ADI methods and a comparison with the Thomas algorithm is given. From the analysis of the amount of operations required, it can be noted that the AGE algorithm requires more computer time than the Thomas algorithm. However it can be seen, that the more nonlinear the problem becomes, the more competitive the AGE algorithm becomes.
0 references
Laplace equation
0 references
alternating group explicit algorithm
0 references
successive overrelaxation
0 references
alternating directions implicit method
0 references
tridiagonal systems
0 references
Thomas algorithm
0 references
0.84508216381073
0 references
0.8222823739051819
0 references
0.8174030184745789
0 references
0.8109058737754822
0 references
