A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials
暂无分享,去创建一个
[1] Erich Kaltofen,et al. Parallel algorithms for matrix normal forms , 1990 .
[2] Viktor Levandovskyy,et al. Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases , 2010, J. Symb. Comput..
[3] P. Cohn. Free rings and their relations , 1973 .
[4] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[5] O. Ore. Theory of Non-Commutative Polynomials , 1933 .
[6] Mark Giesbrecht,et al. On Computing the Hermite Form of a Matrix of Differential Polynomials , 2009, CASC.
[7] Johannes Middeke,et al. A computational view on normal forms of matrices of Ore polynomials , 2012, ACCA.
[8] Nathan Jacobson,et al. Theory of rings , 1943 .