Local uniform mesh refinement on loosely-coupled parallel processors (Q1113648): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q671439
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: William D. Gropp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(88)90159-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088635458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive mesh refinement for hyperbolic partial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of anomalous modes in the Taylor experiment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Test of Moving Mesh Refinement for 2-D Scalar Hyperbolic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local uniform mesh refinement on loosely-coupled parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199478 / rank
 
Normal rank

Latest revision as of 11:24, 19 June 2024

scientific article
Language Label Description Also known as
English
Local uniform mesh refinement on loosely-coupled parallel processors
scientific article

    Statements

    Local uniform mesh refinement on loosely-coupled parallel processors (English)
    0 references
    1988
    0 references
    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.
    0 references
    0 references
    Local uniform mesh refinement
    0 references
    parallel processors
    0 references
    revolving cone problem
    0 references
    0 references
    0 references