Efficient VLSI implementation of iterative solutions to sparse linear systems (Q1801374)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 202445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient VLSI implementation of iterative solutions to sparse linear systems |
scientific article; zbMATH DE number 202445 |
Statements
Efficient VLSI implementation of iterative solutions to sparse linear systems (English)
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
0.90436524
0 references
0.8950205
0 references
0.8927014
0 references
0.8918277
0 references
0.89124525
0 references
