Abstract
Hyperpower iteration is a powerful family of iterative methods for finding outer inverses with arbitrary order of convergence p≥2. In this paper, we present several systematic algorithms for factorizations of the hyperpower iterative family of arbitrary orders with a view to reduce the necessary number of multiplications in each iterative step. Additionally, effective heuristics for factoring arbitrary higher orders hyperpower iteration are presented. The new formulations of the hyperpower iterative steps are convergent with higher computational efficiency indices.
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.
