Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases (Q432750)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases |
scientific article |
Statements
Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases (English)
0 references
4 July 2012
0 references
The authors present a new fraction-free algorithm for the computation of a diagonal form of a matrix over a certain non-commutative Euclidean domain over a computable field with the help of Gröbner bases. They investigate Ore localizations of common operator algebras over \(K[x]\) and use them in the unimodularity analysis of transformation matrices \(U\) and \(V\). Their algorithm, which is implemented in the computer algebra system \texttt{SINGULAR:PLURAL} following the fraction-free strategy, shows impressive performance compared with methods which directly use fractions.
0 references
matrix normal form
0 references
matrix diagonalisation over rings
0 references
Ore localization
0 references
non-commutative Gröbner basis
0 references
decoupling of systems of functional equations
0 references
fraction-free algorithm
0 references
0 references
0 references
