• Tidak ada hasil yang ditemukan

abs_vol17_pp287-303. 28KB Jun 04 2011 12:05:46 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol17_pp287-303. 28KB Jun 04 2011 12:05:46 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

NONNEGATIVE MATRICES WITH PRESCRIBED ELEMENTARY

DIVISORS

RICARDO L. SOTO† AND JAVIER CCAPA

Abstract. The inverse elementary divisor problem for nonnegative matrices asks for neces-sary and sufficient conditions for the existence of a nonnegative matrix with prescribed elementary divisors. In this work a Brauer type perturbation result is introduced. This result allows the con-struction, from a given a list of real or complex numbers Λ ={λ1, . . . , λn},of certain structured nonnegative matrices with spectrum Λ and with any legitimately prescribed elementary divisors.

Key words. Inverse elementary divisor problem, Nonnegative matrices.

AMS subject classifications.15A18, 15A51.

Received by the editors August 31, 2007. Accepted for publication June 2, 2008. Handling

Editor: Michael Neumann.

Departamento de Matem´aticas, Universidad Cat´olica del Norte, Antofagasta, Casilla 1280, Chile

([email protected], [email protected]). Supported by Fondecyt 1050026, Fondecyt 1085125, and Mecesup UCN0202, Chile. Part of this work was done while the authors were visitingat UC3M, Madrid, Spain.

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 17, pp. 287-303, June 2008

Referensi

Dokumen terkait

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m × n matrices and of square matrices with at least one zero row

In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m × n matrix polynomial, and particular lineariza- tions

Stochastic and doubly stochastic matrices are also constructed with a given spectrum and with any legitimately prescribed elementary divisors..

result and known Perron-Frobenius theory of eventually nonnegative matrices are used to establish an algorithm to determine whether a matrix is strongly eventually nonnegative (i.e.,

This paper considers the maximum value of the permanent over the class H (m, n) of n × n Hessenberg, (0, 1)-matrices with m 1’s, and shows that among those matrices that attain

purpose of this paper is to give some necessary and sufficient conditions for the existence and the representations of the group inverse of the block matrix A C..

In Section 3 it is shown that the same situation holds for the nonnegative P0-matrix completion problem, that is, a pattern for n × n matrices that includes all diagonal positions

Applying the properties of the Hadamard core for totally nonnegative matrices, we obtain the Schur complement inequalities for the Hadamard product of totally nonnegative