Abstract
We derive conditions for the existence and investigate representations of {2, 4} and {2,3}-inverses with prescribed range T and null space S. A general computational algorithm for {2,4} and {2,3} generalized inverses with given rank and prescribed range and null space is derived. The algorithm is derived generating the full-rank representations of these generalized inverses by means of various complete orthogonal matrix factorizations. More precisely, computational algorithm for {2,4} and {2,3}-inverses of a given matrix A is defined using an unique approach on SVD, QR and URV matrix decompositions of appropriately selected matrix W.
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.
