Article thumbnail

SURVEY OF PARALLEL MULTIGRID ALGORITHMS.

By Tony F. Chan and Ray S. Tuminaro

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

Year: 1987
OAI identifier: oai:repository.ust.hk:1783.1-48472
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.scopus.com/record/d... (external link)
  • http://lbsearch.ust.hk:3210/sf... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.