Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
From MaRDI portal
Publication:3989777
DOI10.1080/00207169208804037zbMath0745.65028OpenAlexW2046759064MaRDI QIDQ3989777
Publication date: 28 June 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804037
numerical experimentsnumerical stabilitycyclic ADI iterationcyclic Peaceman-Rachford iterationlarge sparse and ill- conditioned linear systemsoptimal round-off error bounds
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of rates of convergence for the modified alternating direction preconditioning (MADP) method
- Application of the AGE algorithm to the SLOR and ADI methods
- The modified alternating group explicit (M.A.G.E.) method
- Round-off error analysis of iterations for large linear systems
- ADI as a Preconditioning for Solving the Convection-Diffusion Equation
- Numerical stability of a cyclic adi iteration
- Alternating-Direction Incomplete Factorizations
- Group explicit iterative methods for solving large linear systems
This page was built for publication: Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration