Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
From MaRDI portal
Publication:633089
DOI10.1016/j.jsc.2010.10.009zbMath1210.13029arXiv1003.3785OpenAlexW1710403350MaRDI QIDQ633089
Viktor 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
matrix normal formnon-commutative Gröbner basisOre localization\texttt{Plural}\texttt{Singular}Jacobson normal formmatrix diagonalization over ring
Related Items
Algebraic Theory of Linear Systems: A Survey ⋮ Minimal Gröbner bases and the predictable leading monomial property ⋮ Serre's reduction of linear partial differential systems with holonomic adjoints ⋮ Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases ⋮ Effective Algebraic Analysis Approach to Linear Systems over Ore Algebras ⋮ On Solution Spaces of Products of Linear Differential or Difference Operators ⋮ Computing valuations of the Dieudonné determinants
Uses Software
Cites Work
- Elimination orderings and localization in PBW algebras.
- Gröbner bases and primary decomposition of polynomial ideals
- Non-commutative elimination in Ore algebras proves multivariate identities
- OreModules: A Symbolic Package for the Study of Multidimensional Linear Systems
- Time-varying polynomial matrix systems
- An algebraic analysis approach to linear time-varying systems
- A Behavioral Approach to Time-Varying Linear Systems. Part 1: General Theory
- Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
