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 33 for “"polynomial matrix"”.

  1. Advanced polynomial matrix factorization techniques

    The advancements in polynomial matrix algebra have significantly bolstered the formulationof broadband array problems, enabling more effective solutions. This is particularlyevident through the utilization of polynomial matrix factorization techniquessuch as the polynomial eigenvalue decomposition …

    strathclyde Repository record for Advanced polynomial matrix factorization techniques (opens in a new tab)

  2. 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)

  3. Advanced algorithms for polynomial matrix eigenvalue decomposition

    Matrix factorisations such as the eigen- (EVD) or singular value decomposition (SVD) offer optimality in often various senses to many narrowband signal processing algorithms.For broadband problems, where quantities such as MIMO transfer functions or cross spectral density matrices are conveniently …

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

  4. MVDR broadband beamforming using polynomial matrix techniques

    … based on a novel technique which relies on polynomial matrix formulations. The new scheme is based on the second order statistics of the array sensor measurements in order to estimate a space-time covariance matrix. The beamforming problem can be formulated based on this space-time …

    strathclyde Repository record for MVDR broadband beamforming using polynomial matrix techniques (opens in a new tab)

  5. Polynomial matrix decompositions and paraunitary filter banks

    … method of diagonalising parahermitian polynomial matrices is proposed and shown to have fundamental limitations. Then the thesis focuses on the development of a novel time-domain technique that extends the eigenvalue decomposition to polynomial matrices, referred to as the second order …

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

  6. Decentralized pole placement using polynomial matrix fractions

    … under decentralization are established using polynomial matrix algebra. The second part deals with the solution of decentralized pole placement problem, in particular, finding a decentralized controller which assigns some set of desired poles. The solution strategy is to reduce the …

    vt Repository record for Decentralized pole placement using polynomial matrix fractions (opens in a new tab)

  7. Broadband angle of arrival estimation using polynomial matrix decompositions

    … problem, which typically involves the covariance matrix of the received data and matrix factorisations such as the eigenvalue decomposition (EVD) to reach optimality in various senses. For broadband arrays, such as found in sonar, acoustics or other applications where signals do not fulfil the …

    strathclyde Repository record for Broadband angle of arrival estimation using polynomial matrix decompositions (opens in a new tab)

  8. 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)

  9. Fast Order Basis and Kernel Basis Computation and Related Problems

    … present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate …

    waterloo Repository record for Fast Order Basis and Kernel Basis Computation and Related Problems (opens in a new tab)

  10. 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)

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

    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)

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

    … the solution is one or more two-variable polynomials (e.g. calculation of the determinant of a two-variable polynomial matrix, calculation of the inverse of a two-variable polynomial matrix, calculation of the greatest common divisor of two-variable polynomials, etc.). With the method …

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

  13. Representing processes as Update Automata and Transducers

    … over a field using Hermite's unimodular polynomial matrix row reduction. These transducers can be viewed as time invariant linear causal maps of the linear space of sequences of vectors over the base field.

    cornell Repository record for Representing processes as Update Automata and Transducers (opens in a new tab)

  14. Computing Popov Forms of Polynomial Matrices

    … algorithm to transform a row reduced matrix to canon- ical Popov form. Given as input a row reduced matrix R over K[x], K a field, our algorithm computes the Popov form in about the same time as required to multiply together over K[x] two matrices of the same dimension and degree as R. …

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

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

  16. Computing Matrix Canonical Forms of Ore Polynomials

    … to compute canonical forms of matrices of Ore polynomials while controlling intermediate expression swell. Given a square non-singular input matrix of Ore polynomials, we give an extension of the algorithm by Labhalla et al. 1992, to compute the Hermite form. We also give a new fraction-free …

    waterloo Repository record for Computing Matrix Canonical Forms of Ore Polynomials (opens in a new tab)

  17. 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)

  18. Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials

    … for computing normal forms for matrices of Ore polynomials while controlling coefficient growth. By formulating row reduction as a linear algebra problem, we obtain a fraction-free algorithm for row reduction for matrices of Ore polynomials. The algorithm allows us to compute the rank and a …

    waterloo Repository record for Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials (opens in a new tab)

Page 1 of 2