• Tidak ada hasil yang ditemukan

abs_vol18_pp700-718. 25KB Jun 04 2011 12:05:47 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol18_pp700-718. 25KB Jun 04 2011 12:05:47 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

TWO INVERSE EIGENPROBLEMS FOR SYMMETRIC DOUBLY

ARROW MATRICES

HUBERT PICKMANN†, JUAN C. EGA ˜NA, ANDRICARDO L. SOTO

Abstract. In this paper, the problem of constructing a real symmetric doubly arrow matrix

Afrom two special kinds of spectral information is considered. The first kind is the minimal and maximal eigenvalues of all leading principal submatrices ofA, and the second kind is one eigenvalue of each leading principal submatrix of Atogether with one eigenpair of A. Sufficient conditions for both eigenproblems to have a solution and sufficient conditions for both eigenproblems have a nonnegative solution are given in this paper. The results are constructive in the sense that they generate algorithmic procedures to compute the solution matrix.

Key words. Symmetric doubly arrow matrices, Inverse eigenproblem.

AMS subject classifications.65F15, 65F18, 15A18.

Received by the editors October 29, 2008. Accepted for publication October 14, 2009. Handling

Editor: Daniel Szyld.

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

([email protected], [email protected] and [email protected]). Supported by Fondecyt 1085125 and Project DGIP-UCN, Chile.

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 18, pp. 700-718, November 2009

Referensi

Dokumen terkait

The smallest number of steps needed to reach all nonnegative local states of a positive two-dimensional (2-D) system is the local reachability index of the system.. The study of such

† Department of Mathematics, Soochow University, Taipei, 11102, Taiwan ([email protected]). Supported in part by Taiwan National

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

Using this description, some superstars are presented for which the problem of ordered multiplicity lists and the Inverse Eigenvalue Problem are not equivalent..

Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extremal graphs are characterized..

The paper studies the eigenvalue distribution of Schur complements of some special matrices, including nonstrictly diagonally dominant matrices and general H − matrices.. Zhang, Xu,

We prove Zhan’s conjecture, and a related inequality for positive semidefinite matrices, using standard facts about principal submatrices, Kronecker products, and the spectral

As Bru, Pedroche and Szyld studied the result in section 4 of [3], we continue to consider A and B to be principal submatrices of a given doubly diagonally dominant matrix such