Systolic Gauss-Jordan elimination for dense linear systems (Q908654): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
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
    0 references
    0 references
    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
    0 references
    systolic array
    0 references
    Gauss-Jordan algorithm
    0 references
    dense linear systems
    0 references
    factorization
    0 references
    0 references