A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse (Q426929): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Hai-Bin Chen / rank | |||
Normal rank | |||
Property / review text | |||
The paper describes an iterative method for computing the Moore-Penrose inverse that is an extension of the method by \textit{W. Li} and \textit{Z. Li} [ibid. 215, No. 9, 3433--3442 (2010; Zbl 1185.65057)]. The paper is short, well-written, and relatively clear. It contains basic concept of the method, three auxiliary lemmas, and the main theorem proving the convergence. The promising numerical experiments are performed for at most \(30\times 30\) matrices. On the other hand, not all is written in the paper. To understand some parameters of the basic iterative scheme, it is necessary to see the original paper by Li and Li. It seems also that the method is not suitable for large-scale problems, since each iteration requires multiplications of matrices -- the time consuming operation. | |||
Property / review text: The paper describes an iterative method for computing the Moore-Penrose inverse that is an extension of the method by \textit{W. Li} and \textit{Z. Li} [ibid. 215, No. 9, 3433--3442 (2010; Zbl 1185.65057)]. The paper is short, well-written, and relatively clear. It contains basic concept of the method, three auxiliary lemmas, and the main theorem proving the convergence. The promising numerical experiments are performed for at most \(30\times 30\) matrices. On the other hand, not all is written in the paper. To understand some parameters of the basic iterative scheme, it is necessary to see the original paper by Li and Li. It seems also that the method is not suitable for large-scale problems, since each iteration requires multiplications of matrices -- the time consuming operation. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Radek Kučera / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A09 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6045802 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Moore-Penrose inverse | |||
Property / zbMATH Keywords: Moore-Penrose inverse / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
iterative method | |||
Property / zbMATH Keywords: iterative method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence rate | |||
Property / zbMATH Keywords: convergence rate / rank | |||
Normal rank |
Revision as of 21:59, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse |
scientific article |
Statements
A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse (English)
0 references
13 June 2012
0 references
The paper describes an iterative method for computing the Moore-Penrose inverse that is an extension of the method by \textit{W. Li} and \textit{Z. Li} [ibid. 215, No. 9, 3433--3442 (2010; Zbl 1185.65057)]. The paper is short, well-written, and relatively clear. It contains basic concept of the method, three auxiliary lemmas, and the main theorem proving the convergence. The promising numerical experiments are performed for at most \(30\times 30\) matrices. On the other hand, not all is written in the paper. To understand some parameters of the basic iterative scheme, it is necessary to see the original paper by Li and Li. It seems also that the method is not suitable for large-scale problems, since each iteration requires multiplications of matrices -- the time consuming operation.
0 references
Moore-Penrose inverse
0 references
iterative method
0 references
convergence rate
0 references