ABSTRACT
This conclusion presents some closing thoughts on the key concepts discussed in the preceding chapters of this book. The book also presents a detailed analysis of the algorithmic approach to codes symbolic calculations wide class of generalized inverse constant, rational and polynomial matrices. It discusses both in theoretical as well as the practical improvement existing methods and algorithms for effective symbolic matrix computations. The book focuses on the issues: finding new and improvement of existing methods for the decomposition of polynomial and rational matrices; the design of efficient algorithms for calculating the generalized inverse matrix. It addresses the other issues: comparison of new methods and algorithms with existing and displaying enhanced and promoted in terms of the complexity of oneness, the speed and efficiency. Several improvements reduce the complexity of most problems with polynomial matrices in the order of magnitude of complexity of matrix multiplication.
