P-Refinement and P-Threads (Preprint)

Abstract

P-type refinement leads to exponential decay of numerical errors for sufficiently smooth solutions and has been used effectively in turbulence and structural mechanics simulations in the context of spectral and hp finite element discretizations. However, it induces a computational cost of O(P[d+1]) in d dimensions, which is higher than lower-order methods. In this paper, we demonstrate that by employing multi-threading within MPI processes we manage to counter- balance the cost increase associated with P-refinement. This approach reduces effectively the wall clock time, and keeps it essentially constant as the polynomial order is increased while achieving exponential convergence rate. Since the number of threads within MPI processes can be dynamically adjusted through thread library functions, the algorithm can be readily adapted for dynamic P-refinement. The resulting hybrid MPI/threads dual-level parallelism is particularly suitable for modern supercomputers consisting of "SMP" nodes. We demonstrate this approach in simulations of two three-dimensional fluid dynamics problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 15, 2002
Accession Number
ADA461985

Entities

People

  • George Karniadakis
  • Steven Dong

Organizations

  • Brown University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computational Fluid Dynamics
  • Computational Science
  • Computations
  • Computer Programming
  • Differential Equations
  • Equations
  • Flow
  • Fluid Mechanics
  • Mechanics
  • Navier Stokes Equations
  • Partial Differential Equations
  • Polynomials
  • Simulations
  • Three Dimensional
  • Two Dimensional

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.