64 search results - page 5 / 13 » Computations with quasiseparable polynomials and matrices |
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
AUTOMATICA
2006
13 years 7 months ago
2006
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
HYBRID
2004
Springer
14 years 22 days ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
COCO
2005
Springer
14 years 27 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...