|Title:|| NOTE ON ``IS SOR COLOR-BLIND?'':
|Authors:|| Y. Shapira
|Abstract:||In their paper ``Is SOR Color-Blind?'', Adams and Jordan show that, for linear systems arising from 2-d PDEs and involving 9-coefficient stencils, the iteration matrix of lexicographically ordered SOR and that of multicolor SOR are similar. In this note, a short and simple proof for the assertion in the general case is given, assuming that the iteration matrix of the sequentially ordered SOR is nonsingular.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0851), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page
Computer science department, Technion