64 search results - page 3 / 13 » Computations with quasiseparable polynomials and matrices |
ISSAC
2005
Springer
14 years 26 days ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
JSC
2006
13 years 7 months ago
2006
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
COMBINATORICS
2004
13 years 7 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...