An efficient computation of generalized inverse of a matrix
From MaRDI portal
Abstract: We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves the 18th order of convergence by using only seven matrix multiplication per iteration loop. This is the record high efficiency for that computational task. The algorithm has a relatively mild numerical instability, and we stabilize it at the price of adding one extra matrix multiplication per iteration loop. This imlplies an efficiency index that significantly exceeds the known record for numerically stable iterations for this task. Our numerical tests cover a variety of examples such as Drazin case, rectangular case, and preconditioning of linear systems. The test results are in good accordance with our formal study and indicate that our algorithms can be of interest for the user.
Recommendations
- Computation of generalized matrix inverses and applications
- scientific article; zbMATH DE number 428073
- Computing generalized inverses using matrix factorizations
- Computation of Generalized Inverse Matrices which Satisfy Specified Conditions
- scientific article; zbMATH DE number 3124837
- An efficient matrix iteration family for finding the generalized outer inverse
- scientific article; zbMATH DE number 4024634
- On recursive calculation of the generalized inverse of a matrix
- An efficient method for computing the inverse of arrowhead matrices
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
Cites work
- A geometrical approach on generalized inverses by Neumann-type series
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- Accuracy and Stability of Numerical Algorithms
- An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An iterative algorithm to compute the Bott-Duffin inverse and generalized Bott-Duffin inverse
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- Chebyshev-type methods and preconditioning techniques
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- Computing outer inverses by scaled matrix iterations
- Convergence of Newton-like methods for singular operator equations using outer inverses
- Functions of Matrices
- Generalized inverse \(A^{(2)}_{T,S}\) and a rank equation
- Generalized Inverses of Linear Transformations
- Generalized inverses. Theory and applications.
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
- Higher-order convergent iterative method for computing the generalized inverse over Banach spaces
- Homotopic residual correction processes
- scientific article; zbMATH DE number 5872173 (Why is no real title available?)
- scientific article; zbMATH DE number 3917552 (Why is no real title available?)
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Hyper-power methods for the computation of outer inverses
- Improving approximate inverses based on Frobenius norm minimization
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- Newton-like iteration based on a cubic polynomial for structured matrices
- Numerical experiments with two approximate inverse preconditioners
- Numerical solution of algebraic Riccati equations.
- On finding robust approximate inverses for large sparse matrices
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- On moment-discretization and least-squares solutions of linear integral equations of the first kind
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Parallel iterative methods for sparse linear systems
- Preconditioners generated by minimizing norms
- Removal of blur in images based on least squares solutions
- Some matrix iterations for computing generalized inverses and balancing chemical equations
- Some New Methods in Matrix Calculation
- Stability of Methods for Matrix Inversion
- The Mathematica GuideBook for Numerics
- The representation and approximation for the generalized inverse \(A^{(2)}_{T,S}\)
Cited in
(28)- An improved parallel algorithm for computing the generalized inverse A^ +
- Fast calculation of Laurent expansions for matrix inverses
- An improved computationally efficient method for finding the Drazin inverse
- An RBF-FD sparse scheme to simulate high-dimensional Black-Scholes partial differential equations
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- Hyperpower least squares progressive iterative approximation
- Exploiting higher computational efficiency index for computing outer generalized inverses
- An efficient matrix iteration family for finding the generalized outer inverse
- Characterizations, iterative method, sign pattern and perturbation analysis for the DMP inverse with its applications
- Hierarchical matrix approximations for space-fractional diffusion equations
- High-order iterative methods for the DMP inverse
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- Interpreter-based approach to generalized matrix inversion
- Computing specified generators of structured matrix inverses
- Computing generalized inverses using LU factorization of matrix product
- scientific article; zbMATH DE number 2058445 (Why is no real title available?)
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix
- Hyper-power methods for the computation of outer inverses
- Finding generalized inverses by a fast and efficient numerical method
- scientific article; zbMATH DE number 839300 (Why is no real title available?)
- A noise-tolerant fast convergence ZNN for dynamic matrix inversion
- Displacement structure of the core inverse
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- Characterizations and representations for the CMP inverse and its application
- GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications
- A new iterative method to find the Moore-Penrose inverse
- Generalized inversion of nonlinear operators
This page was built for publication: An efficient computation of generalized inverse of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740439)
