Fast Order Basis and Kernel Basis Computation and Related Problems
In this thesis, we 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 univa...
Main Author: | Zhou, Wei |
---|---|
Language: | en |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/7326 |
Similar Items
-
Fast Order Basis and Kernel Basis Computation and Related Problems
by: Zhou, Wei
Published: (2013) -
Bases of relations in one or several variables : fast algorithms and applications
by: Neiger, Vincent
Published: (2016) -
Ordered groups with greatest common divisors theory
by: Jiří Močkoř
Published: (2000-01-01) -
Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials
by: Cheng, Howard
Published: (2006) -
Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials
by: Cheng, Howard
Published: (2006)