An Efficient Factorization for the Group Inverse
From MaRDI portal
Recommendations
- A parallel algorithm for computing the group inverse via Perron complementation
- scientific article; zbMATH DE number 5127891
- The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse
- Computing the outer and group inverses through elementary row operations
- GGMRES: a GMRES-type algorithm for solving singular linear equations with index one
Cites work
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Generalized Inverses in Discrete Time Markov Decision Processes
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 3140820 (Why is no real title available?)
- scientific article; zbMATH DE number 3772856 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- LU decomposition of M-matrices by elimination without pivoting
- Markov Renewal Programs with Small Interest Rates
- On the group-inverse of a linear transformation
- Pseudo-Inverses in Associative Rings and Semigroups
- Resolvent expansions of matrices and applications
Cited in
(5)- A generalized inverse method for asymptotic linear programming
- An efficient basis update for asymptotic linear programming
- Computing the outer and group inverses through elementary row operations
- Efficient algorithm for finding inverse and group inverse of the RSFPrLR circulant matrix in codes
- A parallel algorithm for computing the group inverse via Perron complementation
This page was built for publication: An Efficient Factorization for the Group Inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799560)