Application of the AGE algorithm to the SLOR and ADI methods
From MaRDI portal
(Redirected from Publication:1097002)
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.
Recommendations
- scientific article; zbMATH DE number 440656
- The normalised alternating group explicit (nage) method
- Alternating group explicit (AGE) iterative methods
- The modified alternating group explicit (MAGE) algorithm for solving tridiagonal linear equations
- The smart alternating group explicit (smage) method
Cited in
(5)- On some numerical methods for solving 2D radial flow towards an oil well
- Numerical stability of a cyclic adi iteration
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
- The smart alternating group explicit (smage) method
- scientific article; zbMATH DE number 1448785 (Why is no real title available?)
This page was built for publication: Application of the AGE algorithm to the SLOR and ADI methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097002)