Abstract
We present an improvement in the implementation of the Leverrier-Faddeev algorithm for symbolic computation of the Moore-Penrose inverse of one-variable polynomial matrices, introduced in Linear Algebra Appl. 252, 35–60 (1997). Complexity analysis of the original algorithm and its improvement is presented. Algorithm and its improvement are implemented and compared in the symbolic computational package MATHEMATICA. We compare CPU time required for computation of some test matrices by means of the original algorithm and its improvement.
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.
