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

DOI10.1016/J.JSC.2010.10.009MaRDI QIDQ633089zbMATH OpenOpenAlexFDO

Authors V. Levandovskyy, Kristina Schindelar

Publication date 31 March 2011

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

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 1163416 (Why is no real title available?)
• scientific article; zbMATH DE number 1988897 (Why is no real title available?)
• scientific article; zbMATH DE number 2151198 (Why is no real title available?)
• scientific article; zbMATH DE number 2151212 (Why is no real title available?)
• scientific article; zbMATH DE number 227002 (Why is no real title available?)
• scientific article; zbMATH DE number 3367062 (Why is no real title available?)
• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• scientific article; zbMATH DE number 3095858 (Why is no real title available?)
• A Behavioral Approach to Time-Varying Linear Systems. Part 1: General Theory
• An algebraic analysis approach to linear time-varying systems
• Elimination orderings and localization in PBW algebras.
• Gröbner bases and primary decomposition of polynomial ideals
• Mr. Smith goes to Las Vegas: randomized parallel computation of the Smith normal form of polynomial matrices
• Non-commutative elimination in Ore algebras proves multivariate identities
• Noncommutative Noetherian rings. With the cooperation of L. W. Small.
• State representations of time-varying linear systems
• Time-varying polynomial matrix systems
• \textsc{OreModules}: A symbolic package for the study of multidimensional linear systems

Cited in

(11)

• Minimal Gröbner bases and the predictable leading monomial property
• Algebraic theory of linear systems: a survey
• On solution spaces of products of linear differential or difference operators
• 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
• On solving (non)commutative weighted Edmonds' problem
• Serre's reduction of linear partial differential systems with holonomic adjoints
• Effective algebraic analysis approach to linear systems over Ore algebras
• Computing valuations of the Dieudonné determinants
• Computing valuations of the Dieudonné determinants
• A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials

Describes a project that uses

Uses Software

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

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)