Abstract
The nonnegative inverse eigenvalue problem (NIEP) consists of finding necessary and sufficient conditions for the existence of a nonnegative matrix with a given list of complex numbers as its spectrum. If the matrix is required to be Leslie (doubly Leslie), the problem is called the Leslie (doubly Leslie) nonnegative eigenvalue inverse problem. In this paper, necessary and/or sufficient conditions for the existence and construction of Leslie and doubly Leslie matrices with a given spectrum are considered.
MSC:
15A18; 15A29
1. Introduction
A matrix of order n is called nonnegative if all its entries are nonnegative and is denoted by . The nonnegative inverse eigenvalue problem (from now on, the NIEP) consists to find necessary and sufficient conditions for a list of complex numbers to be the spectrum of a nonnegative matrix of order n. A list of n complex numbers is said to be realizable if there exists some nonnegative matrix A with spectrum and that A is the realizing matrix. This problem was firstly considered by Suleĭmanova [1] in 1949. The NIEP remains open for . In Reference [2] this problem was solved for , and for the problem was solved in References [3,4]. It has been studied by several researchers in, for example, References [2,5,6,7,8,9,10,11]. T. Laffey and H. Šmigoc proposed studying the NIEP for lists of complex numbers and a certain class of structured nonnegative matrices, such as symmetric, stochastic, circulant, normal matrices, among others. In this work, we deal with Leslie and doubly Leslie matrices. When the realizing nonnegative matrix is required to be Leslie (doubly Leslie) matrix we call the Leslie (doubly Leslie) nonnegative inverse eigenvalue problem (hereafter, LNIEP and DLNIEP, respectively).
The analysis of a mathematical model that considers internal/external variables, and derives in spectral information (eigenvalues) that allow the behavior of the phenomenon shown in the model to be induced, is called the direct eigenvalues problem. On the contrary, the inverse problem of eigenvalues is to estimate the variables of the system from the behavior of the system(eigenvalues). The nonnegative inverse eigenvalues problem or inverse eigenvalues problem for nonnegative matrices arise from and is applied in different areas such as dynamic systems, pole assignment problem, applied mechanics, inverse Sturm-Liouville problem, applied physics, numerical analysis, signal and data processing, geology, demographic growth, among others [12].
It is well known that a Leslie matrix has a single positive real eigenvalue of modulus greater than or equal to the modulus of the other eigenvalues (see Reference [13]). Therefore, we consider studying the LNIEP (DLNIEP) for a given list of complex numbers with and . This study will allow the estimation of the variables of a Leslie (doubly Leslie) model from the list by reconstructing the matrix that represents it.
In References [14,15], the construction of Leslie stochastic matrices are considered; in the first, the construction of Leslie and doubly Leslie stochastic matrices with zero traces from the coefficients of their characteristic polynomial, and in the second, the construction of Leslie stochastic matrices from a list of nonzero complex numbers, which is a subset of its spectrum. Reference [16] presents the construction of Leslie and doubly Leslie matrices, and companion and doubly companion matrices from particular spectral data. These constructions are independent.
In this paper, we present a different construction of the Leslie matrices from a list closed under complex conjugation and less restive conditions.
On the other hand, in the inverse eigenvalue problem for nonnegative matrices of order n, there exist four necessary conditions. If is the spectrum of a nonnegative matrix, then:
- (i)
- The Perron root belongs to .
- (ii)
- , i.e., must be closed under complex conjugation.
- (iii)
- , where is the kth power sum of the defined bysince if realized , then
- (iv)
- , for all . This necessary condition is due to Loewy and London [2] and Johnson [6]. For , these necessary conditions are not sufficient.
In Reference [17], one of the most important results of the NIEP was established by T. Laffey and H. Šmigoc in the following:
Theorem 1.
[17] Let be complex numbers with real parts less than or equal to zero and let ρ be a positive real number. Then the list is the spectrum of a nonnegative matrix if and only if the following conditions are satisfied:
- (1)
- The list is closed under complex conjugation.
- (2)
- .
- (3)
- .
- (4)
- .
The Leslie matrix, introduced by P. H. Leslie (see References [13,18]), is an nonnegative matrix of the form:
with , and , where not all are zeros. The Leslie matrix is used to study the model of population growth. This model is based on studying the rate of fertility and mortality in subsets of the initial population associated with ages.
Given P the matrix with ones along the secondary diagonal and zeros elsewhere. The matrix
is similar to . If , L is called Frobenius companion matrix or simply companion matrix and denoted by C. It is clear that given is similar to the nonnegative companion matrix C. Indeed, we have with .
Remark 1.
It is easy to check that the characteristic polynomial of L is
Without loss of generality throughout the paper, we shall consider Leslie matrices of the form (1) with .
On the other hand, as L is such that and its associated directed graph is strongly connected, then L is irreducible. Furthermore, if v is an eigenvector of L associated with the Perron eigenvalue , then it is true that
Developing this system and resolving for , then it is obtained that
Definition 1.
[19] An matrix A is said to be nonderogatory if every eigenvalue of A have geometric multiplicity 1.
It is well known that a companion matrix of the form (1), with , is nonderogatory with characteristic polynomial
In Reference [19] the following results were proved.
Theorem 2.
[19] Every monic polynomial is both the minimal polynomial and the characteristic polynomial of its companion matrix.
Theorem 3.
[19] An matrix A is similar to the companion matrix of its characteristic polynomial if and only if the minimal and characteristic polynomial of A are identical.
The doubly Leslie matrices were defined in Reference [20] as a generalization of a doubly companion matrix introduced in Reference [21]. We define a doubly Leslie matrix as follows.
Definition 2.
A doubly Leslie matrix is an nonnegative matrix of the form
with and .
The matrix
is similar to . In particular, if , B is called doubly companion matrix which was introduced in Reference [21] by Butcher and Chartier. It is clear that if , (or ) , then B is a Leslie matrix.
The paper is organized as follows—in Section 2 we obtain a sufficient condition for the LNIEP and lists of numbers in the complex plane. Then, we completely solve the LNIEP for lists with (Laffey-Šmigoc type lists) and for lists of real numbers with (Suleĭmanova type lists). Our results allow calculation of the matrix solution. We also show some examples to illustrate the results. In Section 3 we derive a sufficient condition for the DLNIEP and we completely solve the DLNIEP for Laffey-Šmigoc and Suleĭmanova type lists where the solution matrix is of the form (3) with some additional zeros. Finally, at Section 4 conclusions are presented.
The next result will be very useful later.
Lemma 1.
[17] Let t be a nonnegative real number and let be complex numbers with real parts less than or equal to zero, such that the list is closed under complex conjugation. Let
and
Then implies for .
2. Leslie Matrices with Prescribed Spectrum
In this section, we derive a sufficient condition for the LNIEP and lists of complex numbers . Also, we give necessary and/or sufficient conditions for the existence and construction of Leslie matrices for Laffey-Šmigoc and Suleĭmanova type lists. We start with the following definition.
Definition 3.
[19] The kth elementary symmetric function of the n numbers , is
the sum of all k-fold products of distinct item from .
Theorem 4.
Let be the spectrum of an Leslie matrix, then
Proof.
Let L be a Leslie matrix with spectrum and characteristic polynomial as (2).
It is easy to see that
Theorem 5.
Let be a list of complex numbers such that and satisfies the inequalities given in (4). Then Λ is realizable by an Leslie matrix.
Proof.
Suppose that (4) holds. Let be real numbers and let
be complex nonreal numbers. We define
with , and
Notice that and .
Example 1.
We want to construct a Leslie matrix with spectrum . From Theorem 5 we obtain the Leslie matrix
that has polynomial characteristic
and spectrum Λ.
Remark 2.
Notice that in Example 1, some complex numbers of list Λ have the positive real part, therefore we could not apply Theorem 3 in Reference [17]. The conditions form Theorem 5 allow us to solve the LNIEP, in consequence the NIEP, for lists that lie outside the left half plane.
Now, we shall show that the 2nd elementary symmetric function of a Suleĭmanova type list is nonnegative.
Lemma 2.
Let be a list of real numbers with and . Then .
Proof.
Since , it follows that
Next,
Then,
Therefore,
□
Theorem 6.
Let be a list of complex numbers such that and for . Then Λ is realizable by an Leslie matrix L if and only if .
Proof.
It is clear that the condition is necessary. Let be real numbers and let
be complex nonreal numbers. Since , we obtain that and
By the Lemma 2, we have .
On the other hand, notice that
Next,
Then, from Lemma 1 we have . Thus, is realizable by an Leslie matrix. □
Remark 3.
Notice that the condition of Theorem 6 is simpler than the conditions of Theorem 1. In addition, unlike References [14,17] here the trace is not necessarily greater than or equal to zero
Corollary 1.
Let be a list of real numbers with , and . Then Λ is realizable by an Leslie matrix if and only if .
Proof.
It is immediate from Theorem 6. □
Example 2.
Let . Then from Theorem 6 the matrix
is a Leslie matrix with spectrum Λ.
3. Doubly Leslie Matrices with Prescribed Spectrum
In this section, we present a sufficient condition for the DLNIEP and necessary and sufficient conditions for the existence and construction of doubly Leslie matrices for Laffey-Šmigoc and Suleĭmanova type lists are derived.
From now on, to simplify the calculations, we shall consider the doubly Leslie matrices of the form:
with and .
The following theorem establishes that a doubly Leslie matrix is similar to a companion matrix.
Theorem 7.
The doubly Leslie matrix B defined in (9) is nonderogatory and its characteristic polynomial is
where , and , for .
Proof.
Consider the lower triangular matrix
where
Then, we obtain a companion matrix
with
where and , for . Thus, C is a companion matrix with characteristic polynomial as in (10). Therefore, from Theorem 3 the doubly Leslie matrix B is a nonderogatory. □
In the following Theorem, we shall consider a doubly Leslie matrix of the form
with if n is odd and if n is even.
Theorem 8.
Let be a list of complex numbers such that and satisfies the inequalities given in (4). Then Λ is realizable by an doubly Leslie matrix.
Proof.
Consider as in Theorem 5 and define
for and
for , where and denote the greater integer least than or equal to x and the least integer greater or equal to x, respectively. Notice that and . Then, from Theorem 7 the matrix B, with and newly defined, has characteristic polynomial
if n is odd, and
if n is even.
Therefore, B is the desired doubly Leslie matrix of the form (11) with spectrum . □
Corollary 2.
Let be a list of complex numbers such that and . Then Λ is realizable by a doubly Leslie matrix if and only if .
Proof.
It is immediate from Theorem 6 and Theorem 8. □
Corollary 3.
Let be a list of real numbers with , and . Then Λ is realizable by an doubly Leslie matrix if and only if .
Proof.
It is a consequence of Corollary 1 and Theorem 8. □
Example 3.
Let . Then, from Theorem 8 we have that
is a doubly Leslie matrix with spectrum Λ.
4. Conclusions
In this paper, we give necessary and sufficient conditions for the LNIEP and DLNIEP for Laffey-Šmigoc type lists and as a consequence for Suleĭmanova type lists. Our results provide algorithms for the reconstruction of the matrix from spectral data provided. Such algorithms are applied in the examples presented.
Author Contributions
Conceptualization, H.N. and E.V.; methodology, L.M.; software, H.N.; validation, H.N., E.V. and L.M.; formal analysis, H.N.; investigation, H.N., E.V. and L.M; resources, H.N.; data curation, H.N.; writing–original draft preparation, H.N.; writing–review & editing, H.N.; visualization, E.V.; supervision, L.M.; project administration, H.N.; funding acquisition, H.N. All authors have readand agreed to the published version of the manuscript.
Funding
Hans Nina was supported in part by Comisión Nacional de Investigación Científica y Tecnológica, Grant FONDECYT 11170389, Chile and Universidad de Antofagasta, Antofagasta, Chile, Grant UA INI-17-02. E. Valero was partially supported by Coloquio de Matemáticas Grant UA CR-4430, Chile.
Acknowledgments
We are grateful to Professor Enide Andrade who have suggested modifications to original version which made large improved into the text. The authors would like to thank the referee for his/her constructive suggestions that improved the final version of this paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Suleĭmanova, H.R. Stochastic matrices with real characteristic numbers. Dokl. Akad. Nauk SSSR 1949, 66, 343–345. [Google Scholar]
- Loewy, R.; London, D. A note on an inverse problem for nonnegative matrices. Lin. Multilin. Algebra 1978, 6, 83–90. [Google Scholar] [CrossRef]
- Meehan, M.E. Some Results on Matrix Spectra. Ph.D. Thesis, National University of Ireland, Dublin, Ireland, 1998. [Google Scholar]
- Mayo Torre, J.; Abril, M.R.; Alarcia Estévez, E.; Marijuán, C.; Pisonero, M. The nonnegative inverse problema from the coeficientes of the characteristic polynomial EBL digraphs. Linear Algebra Appl. 2007, 426, 729–773. [Google Scholar] [CrossRef]
- Boyle, M.; Handelman, D. The spectra of nonnegative matrices via symbolic dynamics. Ann. Math. 1991, 2, 249–316. [Google Scholar] [CrossRef]
- Johnson, C.R. Row stochastic matrices similar to doubly stochastic matrices. Lin. Multilin. Algebra 1981, 2, 113–130. [Google Scholar] [CrossRef]
- Laffey, T. Extreme nonnegative matrices. Linear Algebra Appl. 1998, 275/276, 349–357. [Google Scholar] [CrossRef]
- Laffey, T. Realizing matrices in the nonnegative inverse eigenvalue problem. In Matrices and Group Representations; Univesity Coimbra: Coimbra, Portugal, 1991; pp. 21–31. [Google Scholar]
- Šmigoc, H. The inverse eigenvalue problem for nonnegative matrices. Linear Algebra Appl. 2004, 393, 365–374. [Google Scholar] [CrossRef]
- Šmigoc, H. Construction of nonnegative matrices and the inverse eigenvalue problem. Lin. Multilin. Algebra 2005, 53, 85–96. [Google Scholar] [CrossRef]
- Wuwen, G. Eigenvalues of nonnegative matrices. Linear Algebra Appl. 1997, 266, 261–270. [Google Scholar] [CrossRef]
- Chu, T.; Golub, H. Introduction and applications. In Inverse Eigenvalue Problems: Theory, Algorithms, and Applications; Oxford Univesity Press: New York, NY, USA, 2015; pp. 1–28. [Google Scholar]
- Leslie, P.H. On the use of matrices in certain population mathematics. Biometrika 1945, 33, 183–212. [Google Scholar] [CrossRef] [PubMed]
- Benvenuti, L. The NIEP for four dimensional Leslie and doubly stochastic matrices with zero trace from the coefficients of the characteristic polynomial. Linear Algebra Appl. 2018, 544, 286–298. [Google Scholar] [CrossRef]
- Benvenuti, L. The inverse eigenvalue problem for Leslie matrices. Electron. J. Linear Algebra 2019, 35, 319–330. [Google Scholar] [CrossRef]
- Pickman-Soto, H.; Arela-Perez, S.; Nina, H.; Valero, E. Inverse maximal eigenvalues problems for Leslie and Doubly Leslie matrices. Linear Algebra Appl. 2020, 592, 93–112. [Google Scholar] [CrossRef]
- Laffey, T.; Šmigoc, H. Nonnegative realization of spectra having negative real parts. Linear Algebra Appl. 2006, 416, 148–159. [Google Scholar] [CrossRef]
- Leslie, P.H. Some further notes on the use of matrices in population mathematics. Biometrika 1948, 35, 213–245. [Google Scholar] [CrossRef]
- Horn, R.A.; Johnson, C.R. The minimal polynomial and the companion matrix. In Matrix Analysis; Cambridge House: Delhi, India, 2013; pp. 191–200. [Google Scholar]
- Wanicharpichat, W. Explicit minimun polynomial, eigenvector and inverse formula of doubly Leslie matrix. J. Appl. Math. Inform. 2015, 33, 247–260. [Google Scholar] [CrossRef][Green Version]
- Butcher, J.C.; Chartier, P. The effective order of singly-implicit Runge-Kutta. Numer. Algorithms 1999, 20, 269–284. [Google Scholar] [CrossRef]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).