Linear rotation based algorithm and systolic architecture for solving linear system equations (Q1122302)
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: Linear rotation based algorithm and systolic architecture for solving linear system equations |
scientific article; zbMATH DE number 4106116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear rotation based algorithm and systolic architecture for solving linear system equations |
scientific article; zbMATH DE number 4106116 |
Statements
Linear rotation based algorithm and systolic architecture for solving linear system equations (English)
0 references
1989
0 references
A linear rotation based algorithm for triangularization of a non- symmetric matrix is proposed. It combines the simplicity of Gaussian elimination with the stability of Givens rotation. The algorithm is well suited for implementation of the VLSI architecture. The linear system solver is designed with a trapezoidal systolic array in the upper part for performing the triangularization and a linear array in the lower part for the backward substitution. So \(n^ 2/2+2n-2\) processors are used. The realization is possible with the CORDIC algorithms, but it seems preferable to use doubly pipelined systolic architecture with modified CORDIC linear rotation processor.
0 references
parallel linear algebra
0 references
triangularization
0 references
non-symmetric matrix
0 references
Gaussian elimination
0 references
Givens rotation
0 references
VLSI architecture
0 references
CORDIC algorithms
0 references
systolic architecture
0 references
CORDIC linear rotation processor
0 references
0.769230306148529
0 references
0.7672009468078613
0 references