Local uniform mesh refinement on loosely-coupled parallel processors
Local uniform mesh refinement (LUMR) is a powerful technique for the solution of partial differential equations where uniform refinement grids are slaced on a coarse `parent grid'. This paper discusses the implementation of LUMR on a system of loosely coupled parallel processors. The processors are assumed to be connected either by a common bus of local area network of in a linear array and the cost of communication is estimated. Finally the theoretical results are compared with experiments with the revolving cone problem on a 14 node Apollo ring.
- A Test of Moving Mesh Refinement for 2-D Scalar Hyperbolic Problems
- Adaptive mesh refinement for hyperbolic partial differential equations
- Computation of anomalous modes in the Taylor experiment
- scientific article; zbMATH DE number 3640828 (Why is no real title available?)
- Local uniform mesh refinement on loosely-coupled parallel processors
- On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
- Local uniform mesh refinement on loosely-coupled parallel processors
- Recursive mesh refinement on hypercubes
- A static-regridding method for two-dimensional parabolic partial differential equations
- scientific article; zbMATH DE number 4001409 (Why is no real title available?)
- Iterative substructuring methods for spectral elements: Problems in three dimensions based on numerical quadrature
- Local uniform grid refinement and systems of coupled partial differential equations
This page was built for publication: Local uniform mesh refinement on loosely-coupled parallel processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113648)