Parallel performance of multisplitting methods with preweighting (Q2898902)
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: Parallel performance of multisplitting methods with preweighting |
scientific article; zbMATH DE number 6055118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel performance of multisplitting methods with preweighting |
scientific article; zbMATH DE number 6055118 |
Statements
12 July 2012
0 references
multisplitting method
0 references
parallel computation
0 references
preweighting
0 references
preconditioner
0 references
Krylov subspace method
0 references
convergence
0 references
numerical results
0 references
successive overrelaxation
0 references
Parallel performance of multisplitting methods with preweighting (English)
0 references
This paper first gives out a study on the convergence of a special type of multisplitting methods with preweighting for solving linear system. Then it introduces a parallel implementation of the successive overrelaxation (SOR)-like multisplitting method with preweighting and applies it to a parallel preconditioner of Krylov subspace method. At last, it provides the parallel performance results of both the SOR-like multisplitting method with preweighting and Krylov subspace method with the parallel preconditioner. The numerical results show that parallel performance of the method is quite efficient and its application to parallel preconditioner of Krylov subspace method is quite successful.
0 references
0.8416090607643127
0 references
0.8407155275344849
0 references
0.8405411839485168
0 references
0.8272318243980408
0 references
0.8232715725898743
0 references