Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix (Q445846)

From MaRDI portal
Revision as of 19:02, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
scientific article

    Statements

    Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix (English)
    0 references
    0 references
    27 August 2012
    0 references
    An algorithm for computing the Moore-Penrose inverse based on the reduced row echelon form (Gauss-Jordan elimination) is presented. Compared to one existing algorithm, the new variant (which does not require explicitly computing the normal equations matrix) is superior in terms of the complexity.
    0 references
    computational complexity
    0 references
    Gauss-Jordan elimination
    0 references
    Moore-Penrose inverse
    0 references
    algorithm
    0 references

    Identifiers