×

On hyperpower family of iterations for computing outer inverses possessing high efficiencies. (English) Zbl 1327.65087

Summary: Hyperpower iteration is a powerful family of iterative methods for finding outer inverses with arbitrary order of convergence \(p \geq 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.

MSC:

65F30 Other matrix algorithms (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Altman, M., An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space, Pacific J. Math., 10, 1107-1113 (1960) · Zbl 0095.09401
[2] Ben-Israel, A., An iterative method for computing the generalized inverse of an arbitrary matrix, Math. Comp., 19, 452-455 (1965) · Zbl 0136.12703
[3] Ben-Israel, A.; Greville, T. N.E., Generalized Inverses (2003), Springer: Springer New York · Zbl 1026.15004
[4] Climent, J.-J.; Thome, N.; Wei, Y., A geometrical approach on generalized inverses by Neumann-type series, Linear Algebra Appl., 332-334, 533-540 (2001) · Zbl 0986.15005
[5] Liu, X.; Jin, H.; Yu, Y., Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices, Linear Algebra Appl., 439, 1635-1650 (2013) · Zbl 1283.65032
[6] Ostrowski, A. M., Solutions of Equations and Systems of Equations (1966), Academic Press: Academic Press New York, London · Zbl 0222.65070
[7] Petković, M. D.; Petković, M. S., Hyper-power methods for the computation of outer inverses, J. Comput. Appl. Math., 278, 110-118 (2015) · Zbl 1304.65135
[8] Sharifi, M.; Arab, M.; Khaksar Haghani, F., Finding generalized inverses by a fast and efficient numerical method, J. Comput. Appl. Math., 279, 187-191 (2015) · Zbl 1306.65191
[9] Stanimirović, P. S., Self-correcting iterative methods for computing {2}-inverses, Arch. Math., 39, 27-36 (2003) · Zbl 1122.15301
[10] Stanimirović, P. S.; Soleymani, F., A class of numerical algorithms for computing outer inverses, J. Comput. Appl. Math., 263, 236-245 (2014) · Zbl 1301.65032
[11] Soleymani, F., An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T, S}^{(2)}\), Numer. Algorithms, 69, 3, 569-578 (2015) · Zbl 1335.65043
[12] Soleymani, F., A fast convergent iterative solver for approximate inverse of matrices, Numer. Linear Algebra Appl., 21, 439-452 (2014) · Zbl 1340.65051
[13] Soleymani, F.; Stanimirović, P. S.; Ullah, M. Z., An accelerated iterative method for computing weighted Moore-Penrose inverse, Appl. Math. Comput., 222, 365-371 (2013) · Zbl 1329.65073
[14] Soleymani, F., On finding robust approximate inverses for large sparse matrices, Linear Multilinear Algebra, 62, 1314-1334 (2014) · Zbl 1317.65081
[15] Trott, M., The Mathematica Guidebook for Numerics (2006), Springer: Springer New York, NY, USA · Zbl 1101.65001
[16] Xu-Zhou, C.; Hartwig, R. E., The hyperpower iteration revisited, Linear Algebra Appl., 233, 207-229 (1996) · Zbl 0848.65021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.