A parallel multigrid method using the full domain partition (Q1381067): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q370652 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: V. V. Strygin / rank | |||
Normal rank |
Revision as of 06:29, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel multigrid method using the full domain partition |
scientific article |
Statements
A parallel multigrid method using the full domain partition (English)
0 references
15 March 1998
0 references
As it is well known the numerical solution of partial differential equations (PDEs) is a most computationally intensive part of mathematical modeling in many important applications. That is why much research has been performed to find faster methods to solve PDEs. In this paper, the combination of adaptive refinement, multigrid and parallel computing for solving partial differential equations is considered. In the full domain partition, each processor contains a partition of the grid and a minimum number of additional coarse elements required to cover the whole domain. A parallel multigrid algorithm is presented. Numerical computations on a network of up to 32 workstations show that parallel efficiency rates of 50 ones are obtained.
0 references
parallel computation
0 references
numerical examples
0 references
finite element method
0 references
multigrid method
0 references
adaptive refinement
0 references