On hyperpower family of iterations for computing outer inverses possessing high efficiencies

DOI10.1016/J.LAA.2015.07.010MaRDI QIDQ491139zbMATH OpenOpenAlexFDO

Authors Fazlollah Soleymani, Predrag S. Stanimirović, F. Khaksar Haghani

Publication date 24 August 2015

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2015.07.010

zbMATH Keywords

complexityefficiency indexhyperpower iterationouter inverse

Mathematics Subject Classification ID

Recommendations

• Hyper-power methods for the computation of outer inverses
• Factorizations of hyperpower family of iterative methods via least squares approach
• The hyperpower iteration revisited
• An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
• Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)

Cites work

• A class of numerical algorithms for computing outer inverses
• A fast convergent iterative solver for approximate inverse of matrices
• A geometrical approach on generalized inverses by Neumann-type series
• An accelerated iterative method for computing weighted Moore-Penrose inverse
• An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
• An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
• An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space
• Finding generalized inverses by a fast and efficient numerical method
• Generalized inverses. Theory and applications.
• Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
• scientific article; zbMATH DE number 5146586 (Why is no real title available?)
• scientific article; zbMATH DE number 3352737 (Why is no real title available?)
• Hyper-power methods for the computation of outer inverses
• On finding robust approximate inverses for large sparse matrices
• The hyperpower iteration revisited
• The Mathematica GuideBook for Numerics

Cited in

(19)

• From Zhang neural network to scaled hyperpower iterations
• An improved computationally efficient method for finding the Drazin inverse
• Some matrix iterations for computing generalized inverses and balancing chemical equations
• An efficient computation of generalized inverse of a matrix
• Factorizations of hyperpower family of iterative methods via least squares approach
• An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
• A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis
• Hyperpower least squares progressive iterative approximation
• Explicit solutions of the singular Yang-Baxter-like matrix equation and their numerical computation
• An efficient matrix iteration family for finding the generalized outer inverse
• Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
• Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
• A two-step iterative method and its acceleration for outer inverses
• A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
• Hyper-power methods for the computation of outer inverses
• M-QR decomposition and hyperpower iterative methods for computing outer inverses of tensors
• Rapid generalized Schultz iterative methods for the computation of outer inverses
• Schultz matrix iteration based method for stable solution of discrete ill-posed problems
• Improving the efficiency of a Hyperpower method for approximating inverse matrices

This page was built for publication: On hyperpower family of iterations for computing outer inverses possessing high efficiencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491139)