Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
From MaRDI portal
Recommendations
- Computing characteristic polynomials of matrices of structured polynomials
- Efficient computation of the characteristic polynomial
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Calculation of the characteristic polynomial of a matrix
Cites work
- scientific article; zbMATH DE number 1057737 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- Greatest common divisors of polynomials given by straight-line programs
- Le rapport entre le temps et l'espace pour l'évaluation des polynômes
- On computing the determinant in small parallel time using a small number of processors
- On the efficiency of effective Nullstellensätze
- Straight-line programs in geometric elimination theory
- The Space Complexity of Elimination Theory: Upper Bounds
Cited in
(3)
This page was built for publication: Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404687)