207 search results - page 10 / 42 » The Polynomial Method for Random Matrices |
ISSAC
2005
Springer
14 years 1 months 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 ...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
SIAMSC
2010
13 years 6 months ago
2010
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
QEST
2006
IEEE
14 years 2 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...