Interval iterative methods for computing Moore-Penrose inverse (Q864808): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.05.098 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042039906 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interval iterative methods for computing Moore-Penrose inverse |
scientific article |
Statements
Interval iterative methods for computing Moore-Penrose inverse (English)
0 references
13 February 2007
0 references
An interval iterative methods for computing the Moore-Penrose inverse of a full row (or column) rank matrix is presented. By modifying the classical Newton iteration by an interval method, the authors achieve higher numerical accuracy but the computation time is longer. They prove the convergence of the interval iteration. Computational results based on two randomly generated matrices (\(50 \times 60\) and \(500 \times 600\)) are given to exhibit the relatively better accuracy of the proposed algorithm.
0 references
interval method
0 references
Newton iteration
0 references
Moore-Penrose inverse
0 references
numerical examples
0 references
convergence
0 references
