Abstract
When iteratively solving linear systems $$By=b$$By=b with Hermitian positive semi-definite B, and in particular when solving least-squares problems for $$Ax=b$$Ax=b by reformulating them as $$AA^*y=b$$AAźy=b, it is often observed that SOR type methods (Gauβ-Seidel, Kaczmarz) perform suboptimally for the given equation ordering, and that random reordering improves the situation on average. This paper is an attempt to provide some additional theoretical support for this phenomenon. We show error bounds for two randomized versions, called shuffled and preshuffled SOR, that improve asymptotically upon the best known bounds for SOR with cyclic ordering. Our results are based on studying the behavior of the triangular truncation of Hermitian matrices with respect to their permutations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
