Successive overrelaxation (SOR) and related methods
By A. Hadjidimos. 2000
167 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/6a948f3cc038a027bb81404d1986a50ace3e9d57
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- G. Peyr'e
- Tharaj Thaj
- Marco Cuturi
- Emanuele Viterbo
- Pavel Cízek
- L. Čížková
- Palghat A. Ramachandran
- Daniel A. Spielman
Citations in the corpus
- Numerical Linear Algebra (2011, background): “There is a choice of literature devoted to the optimal setting of relaxation parameter: see Hadjidimos (2000) for a recent overview of the main results concerning SOR.”
- Computational Optimal Transport (2018, methodology): “This is similar to the successive overrelaxation method (see, for instance, [Hadjidimos, 2000]), so that the local linear rate of convergence is improved from O((1− κ)`) to O((1− √ κ)`) for some κ > 0 (see Remark 4.”
- Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS Systems (2020, methodology): “The optimum SOR parameter can be analytically calculated given the spectral radius of the Jacobi matrix ρ(Tn) < 1 [21].”