2239 search results - page 6 / 448 » Computing with abstract matrix structures |
104
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
118
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
161
click to vote
MICS
2007
15 years 2 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
101
click to vote
SIAMMAX
2010
14 years 10 months ago
2010
Computational resolution enhancement (superresolution) is generally regarded as a memory intensive process due to the large matrix-vector calculations involved. In this paper, a de...
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...