Coloring update methods
It is known that for a special class of linear systems the iteration matrix of the lexicographically ordered successive overrelaxation (SOR) method and that of multicolor SOR with a special type of coloring have the same spectrum. However this does not imply similarity of the iteration matrices. In the present paper a coloring method for linear update methods (such as SOR) is introduced, whose iteration matrix also has the same spectrum as that of the sequential ordering. This result is more general in the following sense: it applies to general update methods and is independent of the definition of grids and stencils; it guarantees similarity of the iteration matrices of the multicolor and sequential orderings, provided that they are nonsingular.
- Block colouring schemes for the SOR method on local memory parallel computers
- Is SOR Color-Blind?
- Orderings, Multicoloring, and Consistently Ordered Matrices
- Vectorizable algorithm for the (multicolour) successive overrelaxation method
- A parallelizable SOR-like method: Systems with plus-shaped and linear spectra
- scientific article; zbMATH DE number 3797119 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- Is SOR Color-Blind?
- Multigrid methods for 3-D definite and indefinite problems
- Overlapped Multicolor MILU Preconditioning
- The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients
- Two Multigrid Methods for Three-Dimensional Problems with Discontinuous and Anisotropic Coefficients
This page was built for publication: Coloring update methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387248)
