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 5 of 5 for “"Hermite form"”.

  1. Hermite form computation of matrices of differential polynomials

    … polynomials, we first prove the existence of the Hermite form H of A over this ring. Then we determine degree bounds on U and H such that UA=H. Finally, based on the degree bounds on U and H, we compute the Hermite form H of A by reducing the problem to solving a linear system of equations over …

    waterloo Repository record for Hermite form computation of matrices of differential polynomials (opens in a new tab)

  2. Hermite Forms of Polynomial Matrices

    … presents a new 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 …

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

  3. Quaternion polynomial matrices: computing normal forms

    … 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 results relevant to quaternions. In the second chapter, we introduce some properties of polynomial matrices. In the third …

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

  4. Computing Matrix Canonical Forms of Ore Polynomials

    We present algorithms 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 …

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

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

    … basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for …

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