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 4 of 4 for “"Smith normal form"”.

  1. Smith Normal Form over Local Rings and Related Problems

    The Smith normal form is a diagonalization of matrices with many applications in diophantine analysis, graph theory, system control theory, simplicial homology, and more recently, in topological analysis of big data. Efficient computation of Smith normal form is a well-studied area for matrices …

    waterloo Repository record for Smith Normal Form over Local Rings and Related Problems (opens in a new tab)

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

    … 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 the same dimension and size of entries as the input matrix A. If 2 ≤ ω ≤ 3 is a valid exponent for matrix …

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

  3. Bézout Domains and Elementary Divisor Domains: Are They the Same?

    … example which shows that this process as formulated would not lead to an example of a Bézout domain which is not an elementary divisor domain. Throughout the thesis, I also state open questions that could lead to future research in this area.

    byu Repository record for Bézout Domains and Elementary Divisor Domains: Are They the Same? (opens in a new tab) Download PDF for Bézout Domains and Elementary Divisor Domains: Are They the Same? (opens in a new tab)