Efficient VLSI implementation of iterative solutions to sparse linear systems (Q1801374)

From MaRDI portal
Revision as of 19:23, 27 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
Efficient VLSI implementation of iterative solutions to sparse linear systems
scientific article

    Statements

    Efficient VLSI implementation of iterative solutions to sparse linear systems (English)
    0 references
    0 references
    0 references
    0 references
    18 July 1993
    0 references
    In each step of an iterative method to solve a sparse linear system \(Ax=b\), the major computational step is \(x_ k=Px_{k-1}+q\) with a sparse matrix \(P\) (possibly different from \(A\)). The authors propose a way to perform this step on a regular processor grid with a nearest neighbour communication network.
    0 references
    efficient \(VLSI\) implementation
    0 references
    matrix-vector multiplication
    0 references
    multiprocessors
    0 references
    iterative method
    0 references
    sparse linear system
    0 references
    sparse matrix
    0 references
    nearest neighbour communication network
    0 references

    Identifiers