Loading…

An Efficient Factorization for the Group Inverse

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 solutio...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on matrix analysis and applications 1987-10, Vol.8 (4), p.797
Main Author: Lamond, Bernard F
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0895-4798
1095-7162
DOI:10.1137/0608065