Dp 183 en
Algorithms for structured matrices with aplications in polynomial design methods
Author: Frízel Radek
This diploma thesis shows possibilities of acceleration of existing methods for computation of matrices equations and is based on the knowledge of the matrix structure. It focuses on solving the Diophantine equation, which is often required in analysis of control systems where computation speed plays an essential role. A function for MATLAB based on Sylvester method have been implemented, which accelerates the method while preserving the precision of solution. This function co-operates with the "Polynomial Toolbox for Matlab" and uses an external solver LAPACK that has functions for matrices of known structure.