scholarly journals Has the Function Relationship of the Four Diagonal Matrix Inverse Eigenvalue Problem of the Algorithm

Author(s):  
Yun-fei WANG ◽  
Zhi-bin LI
1972 ◽  
Vol 15 (2) ◽  
pp. 189-194 ◽  
Author(s):  
G. N. De Oliveira

By "multiplicative inverse eigenvalue problem" (m.i.e.p., for short) we mean the following. Let A be an n×n matrix and let s1,…, sn be n given numbers. Under what conditions does there exist an n×n diagonal matrix V such that VA has eigenvalues s1,…,sn?In the "additive inverse eigenvalue problem" (a.i.e.p., for short) we seek the diagonal matrix V so that A + V has eigenvalues s1,…, sn?.In the present paper we extend to the m.i.e.p. the ideas used in [7] for the a.i.e.p.By per X we denote the permanent of the square matrix X.


2019 ◽  
Vol 7 (1) ◽  
pp. 230-245
Author(s):  
Macarena Collao ◽  
Mario Salas ◽  
Ricardo L. Soto

Abstract The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}. If the problem has a solution, we say that Λ is realizable and that A is a realizing matrix. In this paper we consider the NIEP for a Toeplitz realizing matrix A, and as far as we know, this is the first work which addresses the Toeplitz nonnegative realization of spectra. We show that nonnegative companion matrices are similar to nonnegative Toeplitz ones. We note that, as a consequence, a realizable list Λ= {λ1, . . ., λn} of complex numbers in the left-half plane, that is, with Re λi≤ 0, i = 2, . . ., n, is in particular realizable by a Toeplitz matrix. Moreover, we show how to construct symmetric nonnegative block Toeplitz matrices with prescribed spectrum and we explore the universal realizability of lists, which are realizable by this kind of matrices. We also propose a Matlab Toeplitz routine to compute a Toeplitz solution matrix.


Sign in / Sign up

Export Citation Format

Share Document