Abstract
An efficient algorithm, based on the L D L ∗ factorization, for computing { 1 , 2 , 3 } and { 1 , 2 , 4 } inverses and the Moore–Penrose inverse of a given rational matrix A , is developed. We consider matrix products A ∗ A and A A ∗ and corresponding L D L ∗ factorizations in order to compute the generalized inverse of A . By considering the matrix products ( R ∗ A ) † R ∗ and T ∗ ( A T ∗ ) † , where R and T are arbitrary rational matrices with appropriate dimensions and ranks, we characterize classes A { 1 , 2 , 3 } and A { 1 , 2 , 4 } . Some evaluation times for our algorithm are compared with corresponding times for several known algorithms for computing the Moore–Penrose inverse.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
