Complexity of dense-linear-system solution on a multiprocessor ring

Ilse C.F. Ipsen; Youcef Saad; Martin H. Schultz

doi:10.1016/0024-3795(86)90169-2

Complexity of dense-linear-system solution on a multiprocessor ring

Ilse C.F. Ipsen, Youcef Saad, Martin H. Schultz

Computer Science and Engineering

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

33 Scopus citations

Abstract

Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.

Original language	English (US)
Pages (from-to)	205-239
Number of pages	35
Journal	Linear Algebra and Its Applications
Volume	77
Issue number	C
DOIs	https://doi.org/10.1016/0024-3795(86)90169-2
State	Published - May 1986

Bibliographical note

Funding Information:
in part by ONR grant NOO01482-K-0184

Access

10.1016/0024-3795(86)90169-2

OpenUrl availability

Full text

Cite this

@article{f6e883dfd6bc453496cf3676ac436c1b,

title = "Complexity of dense-linear-system solution on a multiprocessor ring",

abstract = "Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.",

author = "Ipsen, {Ilse C.F.} and Youcef Saad and Schultz, {Martin H.}",

note = "Funding Information: in part by ONR grant NOO01482-K-0184",

year = "1986",

month = may,

doi = "10.1016/0024-3795(86)90169-2",

language = "English (US)",

volume = "77",

pages = "205--239",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "C",

}

TY - JOUR

T1 - Complexity of dense-linear-system solution on a multiprocessor ring

AU - Ipsen, Ilse C.F.

AU - Saad, Youcef

AU - Schultz, Martin H.

N1 - Funding Information: in part by ONR grant NOO01482-K-0184

PY - 1986/5

Y1 - 1986/5

N2 - Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.

AB - Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.

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

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

U2 - 10.1016/0024-3795(86)90169-2

DO - 10.1016/0024-3795(86)90169-2

M3 - Article

AN - SCOPUS:0004542786

SN - 0024-3795

VL - 77

SP - 205

EP - 239

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - C

ER -

Complexity of dense-linear-system solution on a multiprocessor ring

Abstract

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this