A multigrid algorithm for parallel computers: CPMG (Q1260947): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587121 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Prabhat Kumar Mahanti / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3809173 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3796633 / rank | |||
Normal rank | |||
Latest revision as of 18:44, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multigrid algorithm for parallel computers: CPMG |
scientific article |
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
