Systolic Gauss-Jordan elimination for dense linear systems (Q908654): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Maurice Tchuente / rank | |||
Property / reviewed by | |||
Property / reviewed by: Olof B. Widlund / rank | |||
Property / author | |||
Property / author: Maurice Tchuente / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Olof B. Widlund / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-8191(89)90083-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2018686941 / rank | |||
Normal rank |
Latest revision as of 02:34, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Systolic Gauss-Jordan elimination for dense linear systems |
scientific article |
Statements
Systolic Gauss-Jordan elimination for dense linear systems (English)
0 references
1989
0 references
A systolic array is designed for the Gauss-Jordan algorithm for solving dense linear systems of equations. This algorithm combines the factorization and backsolving step in one loop. The new algorithm saves 25 \% of the cells used in an algorithm due to \textit{R. Melhem} [ibid. 4, 339-343 (1987; Zbl 0618.65021)] but maintains the same speed.
0 references
systolic array
0 references
Gauss-Jordan algorithm
0 references
dense linear systems
0 references
factorization
0 references