Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases

DOI10.1016/J.JSC.2010.10.009zbMATH Open1210.13029arXiv1003.3785OpenAlexW1710403350MaRDI QIDQ633089FDOQ633089

V. Levandovskyy, Kristina Schindelar

Publication date: 31 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr"obner bases. This can be viewed as the pre-processing for the computation of Jacobson normal form and also used for the computation of Smith normal form in the commutative case. We propose a general framework for handling, among other, operator algebras with rational coefficients. We employ special "polynomial" strategy in Ore localizations of non-commutative $G$-algebras and show its merits. In particular, for a given matrix $M$ we provide an algorithm to compute $U,V$ and $D$ with fraction-free entries such that $UMV=D$ holds. The polynomial approach allows one to obtain more precise information, than the rational one e. g. about singularities of the system. Our implementation of polynomial strategy shows very impressive performance, compared with methods, which directly use fractions. In particular, we experience quite moderate swell of coefficients and obtain uncomplicated transformation matrices. This shows that this method is well suitable for solving nontrivial practical problems. We present an implementation of algorithms in SINGULAR:PLURAL and compare it with other available systems. We leave questions on the algorithmic complexity of this algorithm open, but we stress the practical applicability of the proposed method to a bigger class of non-commutative algebras.

Full work available at URL: https://arxiv.org/abs/1003.3785

Recommendations

• Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases
• Algorithms in noncommutative algebras. Gröbner bases and Hilbert series
• A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
• Modular techniques for noncommutative Gröbner bases
• scientific article; zbMATH DE number 1263354

zbMATH Keywords

matrix normal formOre localization\texttt{Plural}\texttt{Singular}Jacobson normal formmatrix diagonalization over ringnon-commutative Gröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• OreModules: A Symbolic Package for the Study of Multidimensional Linear Systems
• Title not available (Why is that?)
• Noncommutative Noetherian rings. With the cooperation of L. W. Small.
• Gröbner bases and primary decomposition of polynomial ideals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-commutative elimination in Ore algebras proves multivariate identities
• Title not available (Why is that?)
• An algebraic analysis approach to linear time-varying systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Behavioral Approach to Time-Varying Linear Systems. Part 1: General Theory
• Elimination orderings and localization in PBW algebras.
• Time-varying polynomial matrix systems
• State representations of time-varying linear systems
• Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
• Title not available (Why is that?)

Cited In (9)

• Minimal Gröbner bases and the predictable leading monomial property
• Effective Algebraic Analysis Approach to Linear Systems over Ore Algebras
• Using computer algebra to diagonalize some Kane matrices
• Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases
• Algebraic Theory of Linear Systems: A Survey
• Serre's reduction of linear partial differential systems with holonomic adjoints
• Computing valuations of the Dieudonné determinants
• Computing valuations of the Dieudonné determinants
• On Solution Spaces of Products of Linear Differential or Difference Operators

Uses Software

• Plural
• SINGULAR
• OreModules
• Janet
• control.lib
• jacobson.lib
• involut.lib

This page was built for publication: Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633089)