An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning

Abstract

An efficient parallel finite element-based domain decomposition iterative technique with polynomial preconditioning with particular attention to the GMRES solver is presented. Unlike the standard row-oriented partitioning of a matrix, finite element based domain decomposition with polynomial preconditioning circumvents the assembly of matrix, reordering of matrix, redundant computations associated with the interface elements, numerical problems associated with local preconditioner, and costly global preconditioner construction. A dramatic reduction in parallel overhead both in terms of computation and communication results in a highly scalable solver. The parallel performance results for large-scale static and dynamic problems on the IBM SP2 and the SGI Origin are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 18, 2005
Accession Number
ADA439487

Entities

People

  • Kumar Tamma
  • Ramdev Kanapady
  • Yu Liang

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Cantilever Beams
  • Coefficients
  • Computations
  • Computer Science
  • Convergence
  • Decomposition
  • Electronic Mail
  • Equations
  • Information Operations
  • Iterations
  • Linear Systems
  • Mathematics
  • Military Research
  • Parallel Computing
  • Polynomials

Readers

  • Computational Fluid Dynamics (CFD)
  • Linear Algebra
  • Parallel and Distributed Computing.