Abstract: The main contribution of this paper is to provide an algorithm for the computation of the minimal polynomial of a two variable polynomial matrix, based on the solution of linear matrix ...

ABSTRACT: In this paper, we combine Graeffe matrices with the classical numerical method of Dandelin-Graeffe to estimate bounds for the moduli of the zeros of polynomials. Furthermore, we give some ...

Consider a convex set S = {x ∈ $\backslash \mathrm{\#}1\mathrm{D}4\mathrm{D}3\backslash $ : G(x) ${ S = \{ x \in \cal{D\cal}: G(x) \succ 0\} }$ 0}, where G(x) is a symmetric matrix whose every entry ...

ABSTRACT: An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors , where , N being very large. Such sequences arise, for ...