A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\) (Q1097639): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Guo-rong Wang / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Charles W. Groetsch / rank | |||
Normal rank |
Revision as of 12:52, 22 February 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