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 “"Popov form"”.
-
Computing Popov Forms of Polynomial Matrices
… thesis gives a deterministic 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 …
-
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 …
-
Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials
… thesis we study algorithms 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 …
-
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 …
-
Fast Order Basis and Kernel Basis Computation and Related Problems
… 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 column basis …