SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Matrix Analysis and Applications / Volume 8 / Issue 4

SIAM. J. on Algebraic and Discrete Methods 8, pp. 797-808 (12 pages)

An Efficient Factorization for the Group Inverse

Bernard F. Lamond

Full Text: Download PDF | Buy PDF (US$25) | View Cart
An efficient algorithm is introduced for computing the group inverse of a square, singular matrix, in factorized form. The algorithm is based on the QR factorization with column pivoting and uses a technique of inversion by partitioning. The factorization is used to compute the group inverse solution of a singular system of equations. When only the solution vector is wanted, the group inverse does not need to be computed explicitly.

© 1987 Society for Industrial and Applied Mathematics

KEYWORDS

AMS Subject Headings

65F05, 65F20

PUBLICATION DATA

ISSN

0895-4798 (print)  
1095-7162 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received May 23, 1986
Accepted July 20, 1987
Digital Object Identifier
http://dx.doi.org/10.1137/0608065

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. An Efficient Factorization for the Group Inverse
  2. Simplified Reliabilities for Consecutive-$k$-out-of-$n$ Systems
  3. On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
  4. Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization
  5. Block Tensor Unfoldings
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close