Abstract
In this paper we construct a few iterative processes for computing {1,2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under suitable conditions these methods converge to the {1,2,3} or {1,2,4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Penrose inverse or to the group inverse. A few error estimates are derived. The advantages of the introduced methods over Tanabe's method [16] for computing reflexive generalized inverses are also investigated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.