Complexity of dense-linear-system solution on a multiprocessor ring (Q1072340)

From MaRDI portal
Revision as of 12:50, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of dense-linear-system solution on a multiprocessor ring
scientific article

    Statements

    Complexity of dense-linear-system solution on a multiprocessor ring (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    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.
    0 references
    complexity
    0 references
    Gaussian elimination
    0 references
    dense linear systems
    0 references
    multiprocessor ring
    0 references

    Identifiers