Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices (Q1862017): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices |
scientific article |
Statements
Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices (English)
0 references
10 March 2003
0 references
The parallel solution of large linear systems with symmetric positive definite (s.p.d.) coefficient matrix by using relaxed multisplitting methods is considered. The diagonally compensated reduction is applied to the multisplitting methods for an s.p.d. matrix. Convergence results for four different variants of relaxed multisplitting methods are given, inter alia a GMJOR (generalized multisplitting Jacobi overrelaxation), a GMSSOR (generalized multisplitting symmetric SOR) and a GMAMOR (generalized multisplitting AMOR). The four methods are compared in terms of their asymptotic convergence rates.
0 references
diagonally compensated reduction
0 references
multisplitting methods
0 references
relaxation
0 references
symmetric positive definite matrix
0 references
parallel computation
0 references
successive overrelaxation
0 references
accelerated overrelaxation
0 references
comparison of methods
0 references
convergence
0 references
