171 search results - page 18 / 35 » On Chebyshev Polynomials of Matrices |
JSC
2000
13 years 7 months ago
2000
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
HYBRID
2004
Springer
14 years 23 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...