Authors: Predrag S Stanimirović Milan B Tasić
Publish Date: 2009/10/03
Volume: 35, Issue: 1-2, Pages: 135-141
Abstract
We present an improvement in the implementation of the LeverrierFaddeev algorithm for symbolic computation of the MoorePenrose inverse of onevariable 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
Keywords: