.png){kind=icon}
.png){kind=icon}
Return
Interval iterative methods for computing Moore-Penrose inverse
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.098.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
interval method
Newton iteration
Moore-Penrose inverse
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available