Fast Order Basis and Kernel Basis Computation and Related Problems

Fast Order Basis and Kernel Basis Computation and Related Problems

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Zhou, Wei
Language:en
Published: 2013
Subjects:
polynomial matrix computation
algorithm
complexity
computer algebra
order basis
kernel basis
linear system solving
matrix inverse
determinant
unimodular completion
Popov form
Hermite form
column reduced form
GCD
matrix GCD
rank
rank profile
column basis
Computer Science
Online Access:http://hdl.handle.net/10012/7326

Internet

http://hdl.handle.net/10012/7326

Similar Items