Optimum sor convergence for complex spectra

DOI10.1080/00207169208804153zbMath0835.65052OpenAlexW2052155610MaRDI QIDQ4323428

S. Galanis

Publication date: 15 April 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804153

zbMATH Keywords

successive overrelaxationJacobi matrixcomplex spectra\(k\)-cyclic matrix\(k\)-step iterative methodYoung-Eidson algorithm\(k\)- cyclic consistently orderedreal optimum relaxation factorSOR-\(k\) method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Over- and underrelaxation for linear systems with weakly cyclic Jacobi matrices of index p
• Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
• On different classes of monoparametric stationary iterative methods for the solution of linear systems
• On the equivalence of the k-step iterative Euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices
• A note on the SOR and CG methods for large least squares problems
• The analysis of k-step iterative methods for linear systems from summability theory
• On some convergence results of the k-step iterative methods
• Sor method andp-cyclic matrices (I)
• On the convergence of monoparametrick-step iterative euler methods for the solution of linear systems
• The Young–Eidson Algorithm: Applications and Extensions
• Best Cyclic Repartitioning for Optimal Successive Overrelaxation Convergence
• Sor method andP-cyclic matrices (II)

This page was built for publication: Optimum sor convergence for complex spectra