Generalised matrix inversion and rank computation by successive matrix powering
From MaRDI portal
Publication:1319512
DOI10.1016/S0167-8191(06)80014-1zbMath0796.65055OpenAlexW1980492087MaRDI QIDQ1319512
Lujuan Chen, Iain Macleod, E. V. Krishnamurthy
Publication date: 10 October 1994
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(06)80014-1
algorithmparallel computationcondition numberrelaxationmatrix equationleast squares solutionsgeneralised inverserank computation
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Related Items (22)
Generalized Schultz iterative methods for the computation of outer inverses ⋮ A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix ⋮ Characterizations, iterative method, sign pattern and perturbation analysis for the DMP inverse with its applications ⋮ Iterative method for computing the Moore-Penrose inverse based on Penrose equations ⋮ Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations ⋮ A family of iterative methods for computing Moore-Penrose inverse of a matrix ⋮ Existence and Representations of Solutions to Some Constrained Systems of Matrix Equations ⋮ Modified SMS method for computing outer inverses of Toeplitz matrices ⋮ Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse ⋮ Hyper-power methods for the computation of outer inverses ⋮ Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\) ⋮ Full-rank representations of \(\{2, 4\}, \{2, 3\}\)-inverses and successive matrix squaring algorithm ⋮ Characterizations, approximation and perturbations of the core-EP inverse ⋮ An interval extension of SMS method for computing weighted Moore-Penrose inverse ⋮ Rapid generalized Schultz iterative methods for the computation of outer inverses ⋮ Successive matrix squaring algorithm for computing outer inverses ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ A new method for computing Moore-Penrose inverse matrices ⋮ Convergence of Rump’s method for computing the Moore-Penrose inverse ⋮ Successive matrix squaring algorithm for computing the Drazin inverse ⋮ Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse ⋮ Characterizations and representations for the CMP inverse and its application
This page was built for publication: Generalised matrix inversion and rank computation by successive matrix powering