The preconditioned Gauss-Seidel method faster than the SOR method (Q935766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The preconditioned Gauss-Seidel method faster than the SOR method |
scientific article; zbMATH DE number 5309278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The preconditioned Gauss-Seidel method faster than the SOR method |
scientific article; zbMATH DE number 5309278 |
Statements
The preconditioned Gauss-Seidel method faster than the SOR method (English)
0 references
8 August 2008
0 references
A new preconditioner for linear systems is presented. The basic idea of this work is based on the fact that the preconditioning effect is not observed on the \(n\)-th row of the system matrix. The convergence and comparison theorems of the proposed method are established by the help of numerical examples, which confirm the well explained theoretical analysis.
0 references
preconditioning
0 references
M-matrix
0 references
Gauss-Seidel method
0 references
splitting
0 references
successive overrelaxation (SOR)
0 references
convergence
0 references
numerical examples
0 references
0 references
