207 search results - page 3 / 42 » The Polynomial Method for Random Matrices |
JC
2008
13 years 5 months ago
2008
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
CORR
2007
Springer
13 years 5 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 5 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...
GI
2010
Springer
13 years 3 months ago
2010
Springer
: Based on previous work of the authors, this paper provides a comparison of two different tracking methodologies for extended objects and group targets, where the true shape of th...