Solving elliptic partial differential equations on the hypercube multiprocessor

Tony F. Chan; Youcef Saad; Martin H. Schultz

doi:10.1016/0168-9274(87)90007-9

Solving elliptic partial differential equations on the hypercube multiprocessor

Tony F. Chan, Youcef Saad, Martin H. Schultz

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

We discuss the implementation of several classical methods for solving elliptic partial differential equations on the hypercube multiprocessor. The methods considered are the alternating directions implicit (ADI) algorithm, a direct banded Gaussian elimination method and multigrid methods. The complexity analysis of these algorithms shows that high efficiencies can be achieved by carefully assigning the data to the processors and (sometimes) resorting to more parallellizable methods. The binary reflected Gray code plays an important role for both the multigrid and the ADI algorithms.

Original language	English (US)
Pages (from-to)	81-88
Number of pages	8
Journal	Applied Numerical Mathematics
Volume	3
Issue number	1-2
DOIs	https://doi.org/10.1016/0168-9274(87)90007-9
State	Published - May 1987

Bibliographical note

Funding Information:
* The first author was supported in part by the Department of Energy under Contract DE-AC02-81ER10996 and by the Army Research Office under Contract DAAG-83-0177. The second and third authors were supported in part by the Office of Naval Research under Grant NOOOl4-82-K-0184 and in part by a joint study with IBM/Kingston.

Access

10.1016/0168-9274(87)90007-9

OpenUrl availability

Full text

Cite this

@article{cfd80d10e79642f9906fdecf932407b5,

title = "Solving elliptic partial differential equations on the hypercube multiprocessor",

abstract = "We discuss the implementation of several classical methods for solving elliptic partial differential equations on the hypercube multiprocessor. The methods considered are the alternating directions implicit (ADI) algorithm, a direct banded Gaussian elimination method and multigrid methods. The complexity analysis of these algorithms shows that high efficiencies can be achieved by carefully assigning the data to the processors and (sometimes) resorting to more parallellizable methods. The binary reflected Gray code plays an important role for both the multigrid and the ADI algorithms.",

author = "Chan, {Tony F.} and Youcef Saad and Schultz, {Martin H.}",

note = "Funding Information: * The first author was supported in part by the Department of Energy under Contract DE-AC02-81ER10996 and by the Army Research Office under Contract DAAG-83-0177. The second and third authors were supported in part by the Office of Naval Research under Grant NOOOl4-82-K-0184 and in part by a joint study with IBM/Kingston.",

year = "1987",

month = may,

doi = "10.1016/0168-9274(87)90007-9",

language = "English (US)",

volume = "3",

pages = "81--88",

journal = "Applied Numerical Mathematics",

issn = "0168-9274",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Solving elliptic partial differential equations on the hypercube multiprocessor

AU - Chan, Tony F.

AU - Saad, Youcef

AU - Schultz, Martin H.

N1 - Funding Information: * The first author was supported in part by the Department of Energy under Contract DE-AC02-81ER10996 and by the Army Research Office under Contract DAAG-83-0177. The second and third authors were supported in part by the Office of Naval Research under Grant NOOOl4-82-K-0184 and in part by a joint study with IBM/Kingston.

PY - 1987/5

Y1 - 1987/5

N2 - We discuss the implementation of several classical methods for solving elliptic partial differential equations on the hypercube multiprocessor. The methods considered are the alternating directions implicit (ADI) algorithm, a direct banded Gaussian elimination method and multigrid methods. The complexity analysis of these algorithms shows that high efficiencies can be achieved by carefully assigning the data to the processors and (sometimes) resorting to more parallellizable methods. The binary reflected Gray code plays an important role for both the multigrid and the ADI algorithms.

AB - We discuss the implementation of several classical methods for solving elliptic partial differential equations on the hypercube multiprocessor. The methods considered are the alternating directions implicit (ADI) algorithm, a direct banded Gaussian elimination method and multigrid methods. The complexity analysis of these algorithms shows that high efficiencies can be achieved by carefully assigning the data to the processors and (sometimes) resorting to more parallellizable methods. The binary reflected Gray code plays an important role for both the multigrid and the ADI algorithms.

UR - http://www.scopus.com/inward/record.url?scp=45949125180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45949125180&partnerID=8YFLogxK

U2 - 10.1016/0168-9274(87)90007-9

DO - 10.1016/0168-9274(87)90007-9

M3 - Article

AN - SCOPUS:45949125180

SN - 0168-9274

VL - 3

SP - 81

EP - 88

JO - Applied Numerical Mathematics

JF - Applied Numerical Mathematics

IS - 1-2

ER -

Solving elliptic partial differential equations on the hypercube multiprocessor

Abstract

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this