A VLSI fast solver for tridiagonal linear systems (Q1108739)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A VLSI fast solver for tridiagonal linear systems |
scientific article; zbMATH DE number 4068162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A VLSI fast solver for tridiagonal linear systems |
scientific article; zbMATH DE number 4068162 |
Statements
A VLSI fast solver for tridiagonal linear systems (English)
0 references
1986
0 references
The area-time complexity of a VLSI solver for tridiagonal linear systems is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor. The proposed VLSI design derives from the parallel version of the well-known odd-even reduction algorithm for tridiagonal linear systems, which requires O(log n) parallel steps. The algorithm is optimal with respect to the parallel complexity.
0 references
VLSI model
0 references
lower bound
0 references
area-time complexity
0 references
tridiagonal linear systems
0 references
odd-even reduction algorithm
0 references
0.9131607
0 references
0.90867686
0 references
0.9064443
0 references
0.8988999
0 references
0.89829206
0 references
0.8929684
0 references
0.8899709
0 references
