Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix (Q797955)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix |
scientific article; zbMATH DE number 3870480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix |
scientific article; zbMATH DE number 3870480 |
Statements
Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix (English)
0 references
1983
0 references
This work is a continuation of a paper by the authors and \textit{N. Rasakhoo} [Appl. Math. Comput. 12, 199-211 (1983; reviewed above)] in which a further development of \textit{H. P. Decell}'s algorithm [SIAM Rev. 7, 526-528 (1965; Zbl 0178.355)] for obtaining the pseudoinverse of a rectangular matrix is proposed. Here a detailed characterization of a finite sequence of matrices and scalars to be computed is presented and these theoretical results are applied to derive analytical and computational properties of the pseudoinverse. Three different tests for determining the rank of a rectangular matrix are suggested and some numerical examples illustrating these tests are given.
0 references
iterative method
0 references
Moore-Penrose generalized inverse
0 references
Decell algorithm
0 references
pseudoinverse
0 references
rank
0 references
rectangular matrix
0 references
numerical examples
0 references
0.8806125521659851
0 references
0.7632187604904175
0 references
0.7593640685081482
0 references
