207 search results - page 2 / 42 » The Polynomial Method for Random Matrices |
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
AMC
2010
13 years 5 months ago
2010
In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a s...
JAT
2010
13 years 3 months ago
2010
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomi...
SIAMMAX
2010
12 years 11 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
DATE
2002
IEEE
13 years 9 months ago
2002
IEEE
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...