• Tidak ada hasil yang ditemukan

abs_vol17_pp316-332. 20KB Jun 04 2011 12:05:46 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol17_pp316-332. 20KB Jun 04 2011 12:05:46 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

EIGENVALUES OF PARTIALLY PRESCRIBED MATRICES

MARIJA DODIG†

Abstract. In this paper, loop connections of two linear systems are studied. As the main result, the possible eigenvalues of a matrix of a system obtained as a result of these connections are determined.

Key words. Loop connections, Feedback equivalence, Eigenvalues.

AMS subject classifications.93B05, 15A21.

Received by the editors June 5, 2007. Accepted for publication June 8, 2008. Handling Editor:

Joao Filipe Queiro.

Centro de Estruturas Lineares e Combinat´orias, CELC, Universidade de Lisboa, Av. Prof.

Gama Pinto 2, 1649-003 Lisboa, Portugal ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 17, pp. 316-332, July 2008

Referensi

Dokumen terkait

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume

The conditioning of the eigenvalue problem of a normal matrixpolynomial is also studied, thereby constructing an appropriate Jordan canonical form..

In this paper the structure of the zero minors of totally positive matrices is studied and applications are presented..

It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has

We study analogues of classical inequalities for the eigenvalues of sums of Hermitian matrices for the cone of admissible elements in the pseudo-Hermitian case.. In particular,

Closed-form formulas are derived for the rank and inertia of submatrices of the Moore–Penrose inverse of a Hermitian matrix.. A variety of consequences on the nonsingularity,

Connections are made with an existing condition number for π T , and the results are applied to the class of Markov chains arising from a random walk on a tree..

From this result a formula is derived to the number of spanning trees in a nested interval graph; this is a generalization of the Cayley formula..