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 20 of 27 for “"Polynomial matrices"”.

  1. Lattice Compression of Polynomial Matrices

    This thesis investigates lattice compression of polynomial matrices over finite fields. For an m x n matrix, the goal of lattice compression is to find an m x (m+k) matrix, for some relatively small k, such that the lattice span of two matrices are equivalent. For any m x n polynomial matrix with …

    waterloo Repository record for Lattice Compression of Polynomial Matrices (opens in a new tab)

  2. Hermite Forms of Polynomial Matrices

    … algorithm for computing the Hermite form of a polynomial matrix. Given a nonsingular n by n matrix A filled with degree d polynomials with coefficients from a field, the algorithm computes the Hermite form of A in expected number of field operations similar to that of matrix multiplication. The …

    waterloo Repository record for Hermite Forms of Polynomial Matrices (opens in a new tab)

  3. Computing Popov Forms of Polynomial Matrices

    … as required to multiply together over K[x] two matrices of the same dimension and degree as R. Randomization can be used to extend the algorithm for rectangular input matrices of full row rank. Thus we give a Las Vegas algorithm that computes the Popov decomposition of matrices of full row rank. …

    waterloo Repository record for Computing Popov Forms of Polynomial Matrices (opens in a new tab)

  4. Quaternion polynomial matrices: computing normal forms

    The applications of quaternion polynomial matrices appear in many fields like applied mathematics, engineering and statistics. In this thesis, we discuss some well-known normal forms of quaternion polynomial matrices. In the first chapter, we outline some of the basic mathematical definitions and …

    manitoba Repository record for Quaternion polynomial matrices: computing normal forms (opens in a new tab)

  5. Preconditioner schemes for elliptic saddle-point matrices based upon Jacobi multi-band polynomial matrices

    … give rise to "elliptic" saddle-point (ESP) matrices, which are difficult to solve numerically. In addition, the problems to be modelled in ground water flow require that the hydraulic conductivity or absolute permeability be a tensor, which adds additional complexity to the resulting …

    rice Repository record for Preconditioner schemes for elliptic saddle-point matrices based upon Jacobi multi-band polynomial matrices (opens in a new tab)

  6. Counting Polynomial Matrices over Finite Fields : Matrices with Certain Primeness Properties and Applications to Linear Systems and Coding Theory

    … is dealing with three mathematical areas, namely polynomial matrices over finite fields, linear systems and coding theory. Coprimeness properties of polynomial matrices provide criteria for the reachability and observability of interconnected linear systems. Since time-discrete linear systems over …

    wurz-thes Repository record for Counting Polynomial Matrices over Finite Fields : Matrices with Certain Primeness Properties and Applications to Linear Systems and Coding Theory (opens in a new tab)

  7. Canonical Forms for Matrices over Polynomial Rings

    … important concepts in matrix algebra is rank of matrices. If the entries of such matrices are from fields or principal ideal domains, then this concept of rank is well-defined. However, when such matrices are defined over the ring of polynomials F[x_1, . . . , x_k ], k ≥ 2 (polynomial matrices in …

    sask Repository record for Canonical Forms for Matrices over Polynomial Rings (opens in a new tab)

  8. Αλγεβρο-πολυωνυμικές υπολογιστικές μέθοδοι στη θεωρία ελέγχου

    Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis focuses on basic theoretical problems of the polynomial point of view of automatic control, but also on the development of algorithms dealing with polynomial matrices of one or more variables. A new …

    greece Repository record for Αλγεβρο-πολυωνυμικές υπολογιστικές μέθοδοι στη θεωρία ελέγχου (opens in a new tab)

  9. Computational methods in the design of linear control systems

    … systems. System representation is in terms of polynomial matrices and two algorithms are presented which are shown to be useful in the design of controllers for such systems. These algorithms are: i) Factorization of a polynomial matrix, and ii) Computation of a unimodular matrix U satisfying …

    rice Repository record for Computational methods in the design of linear control systems (opens in a new tab)

  10. Polynomial matrix decompositions and paraunitary filter banks

    … given to the problem of constructing paraunitary matrices for the purpose of broadband signal subspace estimation. This thesis begins by relating these two areas of research. A frequency-domain method of diagonalising parahermitian polynomial matrices is proposed and shown to have fundamental …

    soton Download PDF for Polynomial matrix decompositions and paraunitary filter banks (opens in a new tab)

  11. 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.

    uiuc Repository record for Laurent Polynomial Inverse Matrices and Multidimensional Perfect Reconstruction Systems (opens in a new tab)

  12. Advanced algorithms for polynomial matrix eigenvalue decomposition

    … transfer functions or cross spectral density matrices are conveniently described by polynomial matrices,such narrowband factorisations are suboptimal at best. To extend the utility of EVD and SVD to the broadband case, polynomial matrix factorisations have gained momentum over the past decade, …

    strathclyde Repository record for Advanced algorithms for polynomial matrix eigenvalue decomposition (opens in a new tab)

  13. Fine-time resolution passive RF source imaging

    … key tools throughout this thesis is the use of polynomial matrices and the polynomial eigenvalue decomposition that allow spatial super resolution techniques, such as the MUSIC algorithm, to be extended to the broadband domain.Results are demonstrated via simulations and statistical analysis …

    strathclyde Repository record for Fine-time resolution passive RF source imaging (opens in a new tab)

  14. 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 …

    aalto Repository record for Eigenstructure of polynomial and rational matrices: perturbation theory and nearness problems (opens in a new tab)

  15. 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 …

    strathclyde Repository record for Algorithmic enhancements to polynomial matrix factorisations (opens in a new tab)

  16. Ανάπτυξη υπολογιστικών μεθόδων στη ρητή παρεμβολή με εφαρμογή σε προβλήματα της θεωρίας ελέγχου

    … of greatest common divisor of univariate polynomials, computation of the inverse as well as the Moore-Penrose and Drazin generalized inverse of a polynomial matrices. Computation of the determinant of a rational matrix is another issue that E-RI technique can be used. It consists a …

    greece Repository record for Ανάπτυξη υπολογιστικών μεθόδων στη ρητή παρεμβολή με εφαρμογή σε προβλήματα της θεωρίας ελέγχου (opens in a new tab)

  17. Performance enhancement for filter bank multicarrier methods in multi-antenna wireless communication systems

    … channel including the filter banks as a polynomial matrix. The formulated polynomial matrix is demonstrated as a tri-diagonal matrix plus two corner elements which indicates that the induced ICI is limited to the direct adjacent spectrally overlapped subchannels. Based on polynomial …

    strathclyde Repository record for Performance enhancement for filter bank multicarrier methods in multi-antenna wireless communication systems (opens in a new tab)

  18. 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 …

    aston Download PDF for Mathematical modelling and optimal multivariable control of chemical processes (opens in a new tab)

  19. Φασματική ανάλυση στην εμφύτευση κανονικών πινάκων

    … condition for existence in the case of Hermitian matrices are the well-known interlacing inequalities. Initially, a new proof of interlacing inequalities for k = 1 is given, from which a geometric profile of V appears. Further, two independent methods for the construction in the case k > 1 are …

    greece Repository record for Φασματική ανάλυση στην εμφύτευση κανονικών πινάκων (opens in a new tab)

Page 1 of 2