Multilevel Algorithms for Generic Coarse Grids for Multigrid Methods

Abstract

Geometric Multigrid methods have gained widespread acceptance for solving large systems of linear equations, especially for structured grids. One of the challenges in successfully extending these methods to unstructured grids is the problem of generating an appropriate set of coarse grids. The focus of this paper is the development of robust algorithms, both serial and parallel, for generating a sequence of coarse grids from the original unstructured grid. Our algorithms treat the problem of coarse grid construction as an optimization problem that tries to optimize the overall quality of the resulting fused elements. We solve this problem using the multilevel paradigm that has been very successful in solving the related grid/graph partitioning problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 09, 2001
Accession Number
AD1020014

Entities

People

  • George Karypis
  • Irene Moulitsas

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Aircrafts
  • Algorithms
  • Aspect Ratio
  • Boundaries
  • Computations
  • Computer Science
  • Construction
  • Engineering
  • High Lift
  • High Performance Computing
  • Mechanics
  • Parallel Computing
  • Parallel Processing
  • Sequences
  • Three Dimensional

Readers

  • Computer Vision.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Systems Analysis and Design