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

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

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


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 languageEnglish (US)
Pages (from-to)205-239
Number of pages35
JournalLinear Algebra and Its Applications
Issue numberC
StatePublished - May 1986

Bibliographical note

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


Dive into the research topics of 'Complexity of dense-linear-system solution on a multiprocessor ring'. Together they form a unique fingerprint.

Cite this