On the convergence of the symmetric SOR method for matrices with red- black ordering

DOI10.1007/BF01399315zbMath0485.65024OpenAlexW1991407757MaRDI QIDQ1164374

G. E. Alefeld

Publication date: 1982

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132784

zbMATH Keywords

successive overrelaxationM-matrixH-matrixsymmetric SOR methodred-black ordering

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (6)

Error Bounds for the SSOR Semi-Iterative Method ⋮ Some new results on the convergence of the SSOR and USSOR methods ⋮ Relaxation parameters and composite refinement techniques ⋮ Reuben Louis Rosenberg (1909--1986) and the Stein-Rosenberg theorem ⋮ \(H\)-splittings and two-stage iterative methods ⋮ Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Zur Konvergenz des symmetrischen Relaxationsverfahrens
• On recurring theorems on diagonal dominance
• Relaxation bei komplexen Matrizen

This page was built for publication: On the convergence of the symmetric SOR method for matrices with red- black ordering