SURVEY OF PARALLEL MULTIGRID ALGORITHMS.

Tony F. Chan*, Ray S. Tuminaro

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

The multigrid algorithm is a fast and efficient (in fact provably optimal) method for solving a wide class of integral and partial differential equations. In addition, it is a natural choice for implementation on parallel computers because of the parallelism inherent in the algorithm. Over the past several years, there has been increasing research into parallel multigrid algorithms, ranging from purely theoretical studies to actual codes running on real parallel computers, some built with multigrid algorithms in mind. It is our goal in this paper to provide a brief but structured account of this field of research.

Original languageEnglish (US)
Pages (from-to)155-170
Number of pages16
JournalAmerican Society of Mechanical Engineers, Applied Mechanics Division, AMD
Volume86
StatePublished - 1987
Externally publishedYes

ASJC Scopus subject areas

  • Mechanical Engineering

Fingerprint

Dive into the research topics of 'SURVEY OF PARALLEL MULTIGRID ALGORITHMS.'. Together they form a unique fingerprint.

Cite this