Effective partitioning method for computing generalized inverses and their gradients |
| |
Authors: | Marko D Petkovi? Milan B Tasi? Predrag S Stanimirovi? |
| |
Institution: | University of Niš, Faculty of Science and Mathematics, Višegradska 33, 18000 Niš, Serbia |
| |
Abstract: | We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from 11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that purpose, we exploit two effective structures form 6], which make use of only nonzero addends in polynomial matrices, and define their partial derivatives. Symbolic computational package MATHEMATICA is used in the implementation. Several randomly generated test matrices are tested and the CPU times required by two used effective structures are compared and discussed. |
| |
Keywords: | Generalized inverses Differentiation Rational matrices Polynomial matrices Sparse matrices Symbolic computation |
本文献已被 ScienceDirect 等数据库收录! |
|