Abstract
Efficient evaluation of the full-rank QDR decomposition is established. A method and algorithm for efficient symbolic computation of AT,S(2) inverses of a given rational matrix A is defined using the full-rank QDR decomposition of an appropriate rational matrix W. The algorithm is implemented using MATHEMATICA’s ability to deal with symbolic expressions as well as with numbers. Examples including polynomial and rational matrices are presented. Some comparisons with well-known methods for symbolic evaluation of generalized inverses are obtained.
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.
