Preconditioning the linear system for the sor method
From MaRDI portal
Publication:4375414
DOI10.1080/00207169808804628zbMATH Open0888.65028OpenAlexW2039436912MaRDI QIDQ4375414FDOQ4375414
Authors: Chang-Jun Li, D. J. Evans 
Publication date: 5 February 1998
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169808804628
Recommendations
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improving Jacobi and Gauss-Seidel iterations
- Modified iterative methods for consistent linear systems
- An Analysis of Block Successive Overrelaxation for a Class of Matrices with Complex Spectra
- Iterationsverfahren bei der konformen Abbildung
- Optimality relationships for p-cyclic SOR
- Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
- Best Cyclic Repartitioning for Optimal Successive Overrelaxation Convergence
Cited In (7)
- A note on the convergence of SOR for the pagerank problem
- Title not available (Why is that?)
- SOR as a preconditioner. II
- Further results on the preconditioned sor method
- Comparison results on preconditioned SOR-type iterative method for \(Z\)-matrices linear systems
- The preconditioned Gauss-Seidel method faster than the SOR method
- Improving the sor method
This page was built for publication: Preconditioning the linear system for the sor method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375414)
