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 3 of 3 for “"Matrix Normal Forms"”.

  1. Computational Approaches to Problems in Noncommutative Algebra -- Theory, Applications and Implementations

    … in certain noncommutative domains and matrix normal forms over noncommutative principal ideal domains. Regarding the area of factorization, we initialize in this thesis a classification of noncommutative domains with respect to the factorization properties of their elements. Such a …

    waterloo Repository record for Computational Approaches to Problems in Noncommutative Algebra -- Theory, Applications and Implementations (opens in a new tab)

  2. Hermite Forms of Polynomial Matrices

    … 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 algorithm …

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

  3. Fast algorithms for computing with integer matrices: normal forms and applications

    … Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving and computing integer matrix normal forms. Our goal is to design algorithms that have complexity about the same as the cost of multiplying together two integer matrices of …

    waterloo Repository record for Fast algorithms for computing with integer matrices: normal forms and applications (opens in a new tab)