A multigrid algorithm for parallel computers: CPMG (Q1260947)
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 399282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multigrid algorithm for parallel computers: CPMG |
scientific article; zbMATH DE number 399282 |
Statements
A multigrid algorithm for parallel computers: CPMG (English)
0 references
29 August 1993
0 references
The authors suggest a new parallel multigrid algorithm and show that the algorithm has nearly the same convergence rate as the \(V\)-cycle multigrid algorithm for those problems for which the initial error is distributed over all frequency modes. The algorithm has been successfully implemented on a parallel machine. It is shown that the algorithm is about 17 percent faster than the standard \(V\)-cycle algorithm.
0 references
parallel multigrid algorithm
0 references
convergence rate
0 references
\(V\)-cycle multigrid algorithm
0 references
0.8356253504753113
0 references
0.8252710103988647
0 references
0.8229905962944031
0 references
0.8068658113479614
0 references
