Adaptive multigrid in parallel

Conference · Fri Dec 01 00:00:00 EST 1995

OSTI ID:125531

Stals, L ^[1]

---

1. Australian National Univ., Canberra (Australia)

Early experiments with parallel multigrid used square domains and uniform grids. Recently, several authors have considered problems with more complicated domains. However these methods still use structured grids. The aim of this paper is to show that it is possible to write efficient multigrid programs using MIMD architectures. By allowing unstructured grids we can solve problems on any polygonal region and use adaptive refinement methods. The program is written in a mixture of C{sup ++} and PVM. It is designed to solve elliptic partial differential equations using the finite element method. We use newest node bisection to refine the grid and the Kernighan-Lin method to rebalance the load.

• OSTI ID: 125531
• Report Number(s): CONF-950212-; TRN: 95:005768-0076
• Resource Relation: Conference: 7. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, San Francisco, CA (United States), 15-17 Feb 1995; Other Information: PBD: 1995; Related Information: Is Part Of Proceedings of the seventh SIAM conference on parallel processing for scientific computing; Bailey, D.H.; Bjorstad, P.E.; Gilbert, J.R. [eds.] [and others]; PB: 894 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
PARTIAL DIFFERENTIAL EQUATIONS
NUMERICAL SOLUTION
FINITE ELEMENT METHOD
ALGORITHMS
PARALLEL PROCESSING
MESH GENERATION