A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\) (Q1097639): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guo-rong Wang / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q587849 / rank
Normal rank
 
Property / author
 
Property / author: Guo-rong Wang / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Charles W. Groetsch / 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/0096-3003(87)90058-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049235729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof for Decell's finite algorithm for generalized inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645536 / rank
 
Normal rank

Latest revision as of 14:40, 18 June 2024

scientific article
Language Label Description Also known as
English
A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)
scientific article

    Statements

    A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\) (English)
    0 references
    1987
    0 references
    The author presents an extension of the Faddeev-Decell algorithm for the weighted Moore-Penrose inverse of a rectangular matrix. In the case of exact computations the algorithm terminates in a finite number of steps. For inexact computations the stopping rule depends, as do those for other such algorithms, on rank determination.
    0 references
    Faddeev-Decell algorithm
    0 references
    weighted Moore-Penrose inverse
    0 references
    stopping rule
    0 references
    rank determination
    0 references
    0 references

    Identifiers