A new class of modified line-SOR algorithms (Q5939864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1623348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new class of modified line-SOR algorithms |
scientific article; zbMATH DE number 1623348 |
Statements
A new class of modified line-SOR algorithms (English)
0 references
5 February 2002
0 references
The paper presents modified versions of the line-successive overrelaxation (SOR) method, firstly proposed in \textit{R. S. Varga} [Matrix iterative analysis, Prentice-Hall (Englewood Cliffs, NJ) (1963; Zbl 0133.08602)] and developed and extended by \textit{Z. I. Woźnicki} [Math. Comput. 62, No. 206, 619-644 (1994; Zbl 0802.65036)]. For these new algorithms, convergence results are proved and an algorithm for determining the optimal value of the modified line-SOR relaxation parameter is described. The authors also present numerical experiments with the modified algorithms on some classes of elliptic boundary value problems, discretized by finite-differences methods on rectangular, hexagonal and triangular mesh structures.
0 references
successive overrelaxation
0 references
sparse matrices
0 references
convergence
0 references
line SOR algorithms
0 references
relaxation parameter
0 references
comparison
0 references
numerical experiments
0 references
elliptic boundary value problems
0 references
finite-differences methods
0 references
0 references
0 references
0.8118975758552551
0 references
0.7937422394752502
0 references
0.7845503687858582
0 references
0.7838088870048523
0 references
0.776961088180542
0 references
