Abstract
Convergence analysis for a class of iterative methods for computing outer inverses with prescribed range and null space is studied. Furthermore, several heuristics for accelerating iterative methods via scaling are proposed. In fact, we are motivated by the fact that scaling of iterative methods for computing generalized inverses is investigated so far only on low-order methods. Our intention is to test the scaling on higher-order iterative methods. Here, we also propose a new higher-order iteration. Although the introduced method is efficient in terms of computational efficiency index, we test its acceleration through several experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
