Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Polynomial matrices"”.
-
Laurent Polynomial Inverse Matrices and Multidimensional Perfect Reconstruction Systems
… set of invertible (resp.: noninvertible) N x P matrices. Lastly we study the generalized inverse on polynomial (resp.: Laurent polynomial) matrices.
-
Eigenstructure of polynomial and rational matrices: perturbation theory and nearness problems
Polynomial and rational matrices are important algebraic objects that have many engineering applications, most notably in control theory. As with more classical matrices over the field of real or complex numbers, many of the properties of polynomial and rational matrices can be described in terms …
-
Algorithmic enhancements to polynomial matrix factorisations
… decomposition (EVD) to parahermitian Laurent polynomial matrices - named the polynomial matrix EVD (PEVD) - has proven to be a useful tool for the decomposition of spacetime covariance matrices and their associated cross-spectral density matrices. Existing PEVD methods typically operate in the …
-
Mathematical modelling and optimal multivariable control of chemical processes
… domain conforming to an algebraic ring of polynomials, to eliminate the transcendental terms which arise in the Laplace domain due to the distributed nature of the plant model. This has made possible the application of linear control theories to a set of linear-partial differential …
-
ΑΝΑΛΥΣΗ ΓΕΝΙΚΕΥΜΕΝΩΝ ΙΔΙΟΜΟΡΦΩΝ ΣΥΣΤΗΜΑΤΩΝ ΑΥΤΟΜΑΤΟΥ ΕΛΕΓΧΟΥ
… A(S). INFINITE ELEMENTARY DIVISORS OF GENERAL POLYNOMIAL MATRICES IS EXAMINED. IT IS SHOWN THAT IMPULSIVE SOLUTIONS ARE DUE TO JORDAN CHAINS OF A "DUAL" POLYNOMIAL MATRIX THAT CORRESPOND TO INFINITE ELEMENTARY DIVISORS THAT ARE ASSOCIATED WITH THE ORDERS OF "ZEROS AT INFINITY" OF THE ORIGINAL …
-
Hybrid Symbolic-Numeric Computing in Linear and Polynomial Algebra
… methods for solving problems in linear and polynomial algebra. We mainly address the approximate GCD problem for polynomials, and problems related to parametric and polynomial matrices. For symbolic methods, our main concern is their complexity and for the numerical methods we are more …