Computing characteristic polynomials of matrices of structured polynomials. (English) Zbl 1365.68498
From the text: We are interested in specific structured matrices obtained from [M. Kauers, personal communication] which arise from combinatorial problems.
MSC:
| 68W30 | Symbolic computation and algebraic computation |
| 12Y05 | Computational aspects of field theory and polynomials (MSC2010) |
| 15A54 | Matrices over function rings in one or more variables |
References:
| [1] | E.H. Bareiss. Sylvester’s Identity and Multistep Integer-Preserving Gaussian Elimination.Mathematics of Computation22(103): 565–578, 1968. · Zbl 0187.09701 |
| [2] | S.J. Berkowitz. On Computing The Determinant in Small Parallel time using a Small Number of Processors.Inf. Processing Letters18(3): 147–150, 1984. · Zbl 0541.68019 · doi:10.1016/0020-0190(84)90018-8 |
| [3] | Henri Cohen.A Course in Computational Algebraic Number Theory.Springer-Verlag, 1995. · Zbl 0786.11071 |
| [4] | M. Law, M. Monagan. Computing Characteristic Polynomials of Matrices of Structured Polynomials. To appear inProceedings of CASC 2016,Springer-Verlag LNCS, 2016. · Zbl 1365.68497 · doi:10.1007/978-3-319-45641-6_22 |
| [5] | M. Kauers, Personal Communication. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
