Abstract
In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results. The convergence of the interval iteration is proven. We also give some numerical examples to compare interval iteration with classical Newton iteration.
| Original language | English |
|---|---|
| Pages (from-to) | 522-532 |
| Number of pages | 11 |
| Journal | Applied Mathematics and Computation |
| Volume | 183 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Dec 2006 |
| Externally published | Yes |
Keywords
- Interval method
- Moore-Penrose inverse
- Newton iteration
Fingerprint
Dive into the research topics of 'Interval iterative methods for computing Moore-Penrose inverse'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver