Effective partitioning method for computing generalized inverses and their gradients (Q544058): Difference between revisions

The paper presents extension of the previous work of the authors: the previous algorithm for computing \{1\},\{1,3\},\{1,4\}, the Moore-Penrose inverse and the weighted Moore-Penrose inverse is extended to the set of multiple-variable rational matrices with complex coefficients. The adaptation is applicable to sparse polynomial matrices. The algorithm works in a symbolic way, is finite recursive and provides gradients of the generalized inverses together with the result. The examples showing significant improvements with respect to previous results on the set of sparse matrices are presented. The algorithms are described using a general algorithmic language. Software package \texttt{MATHEMATICA}\(^\circledR\) is credited in the text, however the implementation is only mentioned (functions \texttt{KalabaEf} and \texttt{KalabaEff}). Source code is not available.