Next Article in Journal
Probability-Based Wildfire Risk Measure for Decision-Making
Next Article in Special Issue
Applications of the Periodogram Method for Perturbed Block Toeplitz Matrices in Statistical Signal Processing
Previous Article in Journal
An Efficient Numerical Method for Fractional SIR Epidemic Model of Infectious Disease by Using Bernstein Wavelets
Previous Article in Special Issue
Generalized Structure Preserving Preconditioners for Frame-Based Image Deblurring
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Note on NIEP for Leslie and Doubly Leslie Matrices

1
Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta 1240000, Chile
2
Departamento de Matemática, Universidad de Tarapacá, Arica 1000000, Chile
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(4), 559; https://doi.org/10.3390/math8040559
Submission received: 10 March 2020 / Revised: 6 April 2020 / Accepted: 7 April 2020 / Published: 10 April 2020
(This article belongs to the Special Issue Matrix Structures: Numerical Methods and Applications)

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.

1. Introduction

A matrix A = ( a i j ) i , j n of order n is called nonnegative if all its entries a i j are nonnegative and is denoted by A 0 . The nonnegative inverse eigenvalue problem (from now on, the NIEP) consists to find necessary and sufficient conditions for a list Λ = ( λ 1 , λ 2 , , λ n ) of complex numbers to be the spectrum of a nonnegative matrix of order n. A list Λ = ( λ 1 , λ 2 , , λ n ) of n complex numbers is said to be realizable if there exists some n × n nonnegative matrix A with spectrum σ ( A ) = { λ 1 , λ 2 , , λ n } and that A is the realizing matrix. This problem was firstly considered by Suleĭmanova [1] in 1949. The NIEP remains open for n 5 . In Reference [2] this problem was solved for n = 3 , and for n = 4 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 Λ = ( λ 1 , λ 2 , , λ n ) with λ 1 > 0 and λ 1 | λ i | , i = 2 , , n . 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 Λ = ( λ 1 , λ 2 , , λ n ) is the spectrum of a nonnegative matrix, then:
(i)
The Perron root λ 1 = max { | λ i | : λ i Λ } belongs to Λ .
(ii)
Λ ¯ = Λ , i.e., Λ must be closed under complex conjugation.
(iii)
s k 0 , k = 1 , 2 , , where s k is the kth power sum of the Λ defined by
s k = λ 1 k + λ 2 k + + λ n k ,
since if A 0 realized Λ , then s k = trace ( A k ) 0
(iv)
s m k n k 1 s k m , for all k , m = 1 , 2 , . This necessary condition is due to Loewy and London [2] and Johnson [6]. For n = 4 , 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 ( λ 2 , , λ n ) be complex numbers with real parts less than or equal to zero and let ρ be a positive real number. Then the list σ = ( ρ , λ 2 , , λ n ) is the spectrum of a nonnegative matrix if and only if the following conditions are satisfied:
(1) 
The list ( ρ , λ 2 , , λ n ) is closed under complex conjugation.
(2) 
s 1 = ρ + i = 2 n λ i 0 .
(3) 
s 2 = ρ 2 + i = 2 n λ i 2 0 .
(4) 
s 1 2 n s 2 .
The Leslie matrix, introduced by P. H. Leslie (see References [13,18]), is an n × n nonnegative matrix of the form:
L = a 1 a 2 a 3 a n b n 1 0 0 0 b n 2 0 0 b 1 0
with 0 < b j 1 , j = 1 , 2 , , n 1 , and a k 0 , k = 1 , 2 , , n , 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 a k and mortality b j in subsets of the initial population associated with ages.
Given P the matrix with ones along the secondary diagonal and zeros elsewhere. The matrix
L = P L P 1 = 0 b 1 0 0 b n 2 0 0 0 b n 1 a n a n 1 a 2 a 1
is similar to L . If b j = 1 , j = 1 , 2 , , n 1 , L is called Frobenius companion matrix or simply companion matrix and denoted by C. It is clear that given b 1 , b 2 , , b n 1 , L is similar to the nonnegative companion matrix C. Indeed, we have C = D L D 1 with D = diag ( 1 , b 1 , b 1 b 2 , , b 1 b 2 b n ) .
Remark 1. 
It is easy to check that the characteristic polynomial of L is
p ( x ) = x n a 1 x n 1 a 2 b n 1 x n 2 a n b n 1 b n 2 b 1 .
Without loss of generality throughout the paper, we shall consider Leslie matrices of the form (1) with a n 0 .
On the other hand, as L is such that b j 0 , j = 1 , 2 , , n 1 , and a n 0 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
L v = λ v .
Developing this system and resolving for v n = 1 , then it is obtained that
v = b 1 b 2 b n 2 b n 1 λ n 1 , b 2 b 3 b n 2 b n 1 λ n 2 , , b n 2 b n 1 λ 2 , b n 1 λ , 1 .
Definition 1. 
[19] An n × n 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 b j = 1 , j = 1 , 2 , , n 1 , is nonderogatory with characteristic polynomial
q ( x ) = x n a 1 x n 1 a 2 x n 2 a n .
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 n × n 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 n × n nonnegative matrix of the form
B = a 1 a 2 a n 1 a n + c n b n 1 0 0 c n 1 0 b 2 0 c 2 0 0 b 1 c 1
with a k , c k 0 , k = 1 , , n and 0 < b j 1 , j = 1 , , n 1 .
The matrix
B = P B P 1 = c 1 b 1 0 0 c 2 0 b 2 0 c n 1 0 0 b n 1 c n + a n a n 1 a 2 a 1
is similar to B . In particular, if b j = 1 , j = 1 , 2 , , n 1 , B is called doubly companion matrix which was introduced in Reference [21] by Butcher and Chartier. It is clear that if c j = 0 , (or a j = 0 ) j = 1 , , n , 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 Λ = ( λ 1 , λ 2 , , λ n ) with λ 1 > 0 , Re λ i 0 , | Re ( λ i ) | | Im λ i | , i = 2 , , n (Laffey-Šmigoc type lists) and for lists of real numbers Λ = ( λ 1 , λ 2 , , λ n ) with λ 1 > 0 λ 2 λ 3 λ n (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 λ 2 , λ 3 , λ n be complex numbers with real parts less than or equal to zero, such that the list ( λ 2 , λ 3 , , λ n ) is closed under complex conjugation. Let
λ 1 = 2 t λ 2 λ n
and
f ( x ) = ( x λ 1 ) j = 2 n ( x λ j ) = x n 2 t x n 1 + α 2 x n 2 + + α n .
Then α 2 0 implies α j 0 for j = 3 , 4 , , n .

2. Leslie Matrices with Prescribed Spectrum

In this section, we derive a sufficient condition for the LNIEP and lists of complex numbers Λ = ( λ 1 , λ 2 , , λ n ) . 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 λ 1 , λ 2 , , λ n , k n , is
S k ( λ 1 , λ 2 , , λ n ) = 1 i 1 i 2 i k n j = 1 k λ i j
the sum of all n k k-fold products of distinct item from λ 1 , λ 2 , , λ n .
Theorem 4. 
Let Λ = ( λ 1 , , λ n ) be the spectrum of an n × n Leslie matrix, then
( 1 ) k + 1 S k ( Λ ) 0 , k = 1 , 2 , , n .
Proof. 
Let L be a Leslie matrix with spectrum Λ = ( λ 1 , , λ n ) and characteristic polynomial as (2).
It is easy to see that
f ( x ) = ( x λ 1 ) ( x λ 2 ) ( x λ n ) = x n S 1 ( Λ ) x n 1 + S 2 ( Λ ) x n 2 + ( 1 ) n + 1 S n ( Λ ) .
It follows from (2) and (5) that
λ 1 + λ 2 + + λ n 0 ( λ 1 λ 2 + λ 1 λ 3 + + λ n 1 λ n ) 0 λ 1 λ 2 λ 3 + λ 1 λ 2 λ 4 + + λ n 2 λ n 1 λ n 0 ( 1 ) n + 1 λ 1 λ 2 λ n 0 ,
and the inequalities in (4) hold. □
Theorem 5. 
Let Λ = ( λ 1 , , λ n ) be a list of complex numbers such that Λ ¯ = Λ , λ 1 | λ i | , i = 1 , , n , and satisfies the inequalities given in (4). Then Λ is realizable by an n × n Leslie matrix.
Proof. 
Suppose that (4) holds. Let λ 1 > 0 λ 2 λ p 1 be real numbers and let
λ p , λ p + 1 , , λ p + l , λ ¯ p + l , , λ ¯ p = λ n
be complex nonreal numbers. We define
b j = | λ n + 1 j | M , j = 1 , , n 1 ,
with M = max { 1 , max { | λ n + 1 j | , j = 2 , , n } } , and
a 1 = S 1 ( Λ ) , a k = ( 1 ) k + 1 S k ( Λ ) = 2 k b n + 1 , k = 2 , , n .
Notice that 0 < b j 1 , j = 1 , , n 1 and a k 0 , k = 1 , , n .
Then, with b j , a k , defined in (6) and (7), we obtain a matrix L of the form (1). From Remark 1, the obtained matrix L has characteristic polynomial as in (2), which is equal to (5). Therefore, L is the desired Leslie matrix with spectrum Λ . □
Example 1. 
We want to construct a Leslie matrix with spectrum Λ = { 5 , 1 10 + i , 1 10 i , 1 + i , 1 i } . From Theorem 5 we obtain the Leslie matrix
L = 0 1 0 0 0 0 0 101 10 2 0 0 0 0 0 1 0 0 0 0 0 101 10 2 20 1216 101 1143 2 10 101 639 2 10 101 16 5
that has polynomial characteristic
p ( x ) = x 5 16 5 x 4 639 100 x 3 1143 100 x 2 152 25 x 101 10 .
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 Λ = ( λ 1 , , λ n ) be a list of real numbers with λ 1 > 0 λ 2 λ 3 λ n and i = 1 n λ i 0 . Then S 2 ( Λ ) 0 .
Proof. 
Since i = 1 n λ i 0 , it follows that
k = 1 j λ k k = 1 j + 1 λ k 0 , j = 1 , , n 1 .
Next,
λ n ( λ 1 + + λ n 1 ) 0 λ n 1 ( λ 1 + + λ n 2 ) 0 λ 3 ( λ 1 + λ 2 ) 0 λ 1 λ 2 0 .
Then,
λ 1 ( λ 1 + + λ n ) + λ 2 ( λ 3 + + λ n ) + λ n 1 λ n 0 .
Therefore,
S 2 ( Λ ) = λ 1 λ 2 + λ 3 ( λ 1 + λ 2 ) + + λ n ( λ 1 + λ 2 + + λ n 1 ) = λ 1 ( λ 1 + + λ n ) + λ 2 ( λ 3 + + λ n ) + λ n 1 λ n 0 .
Theorem 6. 
Let Λ = ( λ 1 , , λ n ) be a list of complex numbers such that Λ ¯ = Λ , λ 1 | λ i | , Re ( λ i ) 0 and | Re ( λ i ) | | Im ( λ i ) | for i = 2 , , n . Then Λ is realizable by an n × n Leslie matrix L if and only if i = 1 n λ i 0 .
Proof. 
It is clear that the condition is necessary. Let λ 1 > 0 λ 2 λ p 1 be real numbers and let
λ p , λ p + 1 , , λ p + , λ p + ¯ , , λ p ¯ = λ n
be complex nonreal numbers. Since i = 1 n λ i 0 , we obtain that i = 2 Re ( λ i ) < 0 and
λ 1 + i = 2 Re ( λ i ) λ 1 + 2 i = 2 Re ( λ i ) 0 .
By the Lemma 2, we have i < j p 1 λ i λ j 0 .
On the other hand, notice that
j = 1 p 1 λ j + k = p p + Re ( λ k ) 0 .
Next,
S 2 ( Λ ) = λ 1 ( λ 2 + + λ p 1 + λ p + λ p + 1 + + λ p + + λ ¯ p + + + λ ¯ p ) + λ 2 ( λ 3 + + λ p 1 + λ p + λ p + 1 + + λ p + + λ ¯ p + + + λ ¯ p ) + λ p 1 ( λ p + λ p + 1 + + λ p + , λ ¯ p + + + λ ¯ p ) + λ ¯ p + 1 λ ¯ p = k = p p + 2 Re ( λ k ) j = 1 p 1 λ j + 1 i < j p 1 λ i λ j + k = p p + λ k 2 + 2 2 p s < t p + Re ( λ s ) Re ( λ t ) 2 k = p p + Re ( λ k ) j = 1 p 1 λ j + 1 i < j p 1 λ i λ j + 2 k = p p + Re ( λ k ) 2 + 2 2 p s < t p + Re ( λ s ) Re ( λ t ) = 2 k = p p + Re ( λ k ) j = 1 p 1 λ j + k = p p + Re ( λ k ) + 1 i < j p 1 λ i λ j 0 .
Then, from Lemma 1 we have ( 1 ) k + 1 S k ( Λ ) 0 , k = 3 , , n . Thus, Λ is realizable by an n × n 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 Λ = ( λ 1 , , λ n ) be a list of real numbers with λ 1 > 0 > λ 2 λ 3 λ n , and λ 1 | λ i | , i = 2 , , n . Then Λ is realizable by an n × n Leslie matrix if and only if i = 1 n λ i 0 .
Proof. 
It is immediate from Theorem 6. □
Example 2. 
Let Λ = ( 9 , 2 + i , 2 + 2 i , 2 i , 2 2 i ) . Then from Theorem 6 the matrix
L = 0 1 0 0 0 0 0 5 2 5 0 0 0 0 0 1 0 0 0 0 0 5 2 5 576 3424 5 418 2 5 86 2 5 1
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:
B = c 1 b 1 0 0 c 2 0 b 2 0 c n 1 0 0 b n 1 c n a n a n 1 a 2 a 1
with 0 < b j 1 , j = 1 , 2 , , n 1 and a i , c i 0 , i = 1 , 2 , , n .
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
p ( x ) = x n + ( d 1 + f 1 ) x n 1 + i + j = 2 d i f j + d 2 + f 2 x n 2 + + i + j = n 1 d i f j + d n 1 + f n 1 x + i + j = n d i f j + d n + f n ,
where d 1 = a 1 , f 1 = c 1 , and d i = a i k = n + 1 i n 1 b k , f j = c j k = 1 j 1 b k , for i , j = 2 , 3 , , n .
Proof. 
Consider the lower triangular matrix
T = 1 0 0 0 c 1 b 1 1 b 1 0 0 c 2 b 2 c 1 b 1 b 2 1 b 1 b 2 0 c n 2 b n 2 c n 3 b n 3 b n 2 c n 4 b n 4 b n 3 b n 2 1 b 1 b 2 b n 2 0 c n 1 b n 1 c n 2 b n 2 b n 1 c n 3 b n 3 b n 2 b n 1 c 1 b 1 b 2 b n 1 1 b 1 b 2 b n 1
where
T 1 = e 1 T e 1 T B e 1 T B 2 e 1 T B n 1 , and e 1 T = 1 0 0 .
Then, we obtain a companion matrix
C = T 1 B T = 0 1 0 0 0 0 1 0 0 0 0 1 α n α n 1 α 2 α 1
with
α 1 = d 1 + f 1 α 2 = i + j = 2 d i f j + d 2 + f 2 α n 1 = i + j = n 1 d i f j + d n 1 + f n 1 α n = i + j = n d i f j + d n + f n
where d 1 = a 1 , f 1 = c 1 and d i = a i k = n + 1 j n 1 b k ; f j = c j k = 1 j 1 b k , for i , j = 2 , 3 , , n . 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
B = 0 b 1 0 0 c 2 0 b 2 0 0 0 0 b 3 0 0 0 0 0 b n 1 b n , 1 0 a 3 0 a 1
with b n , 1 = c n if n is odd and b n , 1 = a n if n is even.
Theorem 8. 
Let Λ = ( λ 1 , , λ n ) be a list of complex numbers such that Λ ¯ = Λ , λ 1 | λ i | , i = 1 , , n and satisfies the inequalities given in (4). Then Λ is realizable by an n × n doubly Leslie matrix.
Proof. 
Consider b j , j = 1 , , n 1 as in Theorem 5 and define
a 1 = S 1 ( Λ ) , a 2 k = 0 ,
a 2 k 1 = S 2 k 1 ( Λ ) j = i k 1 d 2 j 1 f 2 ( k j ) = n 2 ( k 1 ) n 1 b 1
for k = 2 , , n 2 and
c 2 k = S 2 k ( Λ ) = 1 2 k 1 b , c 2 k 1 = 0 ,
for k = 1 , 2 , , n 2 , where x and x denote the greater integer least than or equal to x and the least integer greater or equal to x, respectively. Notice that 0 < b j 1 , j = 1 , , n 1 and a 2 k 1 , c 2 k 0 . Then, from Theorem 7 the matrix B, with b j , a 2 k 1 and c 2 k newly defined, has characteristic polynomial
p ( x ) = x n + a 1 x n 1 + c 2 b 1 x n 2 + + c n 1 b 1 b n 2 x + i + j = n d i f j + a n b 1 b n 1 ,
if n is odd, and
p ( x ) = x n + a 1 x n 1 + c 2 b 1 x n 2 + + i + j = n 1 d i f j + a n b 1 b n 1 x + c n b 1 b n 1
if n is even.
Therefore, B is the desired doubly Leslie matrix of the form (11) with spectrum Λ . □
Corollary 2. 
Let Λ = ( λ 1 , , λ n ) be a list of complex numbers such that Λ ¯ = Λ , λ 1 | λ i | , Re ( λ i ) 0 and | Re ( λ i ) | | Im ( λ i ) | , i = 2 , , n . Then Λ is realizable by a doubly Leslie matrix if and only if i = 1 n λ i 0 .
Proof. 
It is immediate from Theorem 6 and Theorem 8. □
Corollary 3. 
Let Λ = ( λ 1 , , λ n ) be a list of real numbers with λ 1 > 0 > λ 2 λ 3 λ n , and λ 1 | λ i | , i = 2 , , n . Then Λ is realizable by an n × n doubly Leslie matrix if and only if i = 1 n λ i 0 .
Proof. 
It is a consequence of Corollary 1 and Theorem 8. □
Example 3. 
Let Λ = ( 7 , 1 + 2 i , 2 + 2 i , 1 2 i , 2 2 i ) . Then, from Theorem 8 we have that
B = 0 1 0 0 0 21 0 5 2 2 0 0 0 0 0 1 0 424 2 5 0 0 0 5 2 2 26112 5 0 264 2 2 0 1
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

  1. Suleĭmanova, H.R. Stochastic matrices with real characteristic numbers. Dokl. Akad. Nauk SSSR 1949, 66, 343–345. [Google Scholar]
  2. Loewy, R.; London, D. A note on an inverse problem for nonnegative matrices. Lin. Multilin. Algebra 1978, 6, 83–90. [Google Scholar] [CrossRef]
  3. Meehan, M.E. Some Results on Matrix Spectra. Ph.D. Thesis, National University of Ireland, Dublin, Ireland, 1998. [Google Scholar]
  4. 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] [Green Version]
  5. Boyle, M.; Handelman, D. The spectra of nonnegative matrices via symbolic dynamics. Ann. Math. 1991, 2, 249–316. [Google Scholar] [CrossRef]
  6. Johnson, C.R. Row stochastic matrices similar to doubly stochastic matrices. Lin. Multilin. Algebra 1981, 2, 113–130. [Google Scholar] [CrossRef]
  7. Laffey, T. Extreme nonnegative matrices. Linear Algebra Appl. 1998, 275/276, 349–357. [Google Scholar] [CrossRef] [Green Version]
  8. 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]
  9. Šmigoc, H. The inverse eigenvalue problem for nonnegative matrices. Linear Algebra Appl. 2004, 393, 365–374. [Google Scholar] [CrossRef] [Green Version]
  10. Šmigoc, H. Construction of nonnegative matrices and the inverse eigenvalue problem. Lin. Multilin. Algebra 2005, 53, 85–96. [Google Scholar] [CrossRef]
  11. Wuwen, G. Eigenvalues of nonnegative matrices. Linear Algebra Appl. 1997, 266, 261–270. [Google Scholar] [CrossRef] [Green Version]
  12. 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]
  13. Leslie, P.H. On the use of matrices in certain population mathematics. Biometrika 1945, 33, 183–212. [Google Scholar] [CrossRef] [PubMed]
  14. 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]
  15. Benvenuti, L. The inverse eigenvalue problem for Leslie matrices. Electron. J. Linear Algebra 2019, 35, 319–330. [Google Scholar] [CrossRef]
  16. 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]
  17. Laffey, T.; Šmigoc, H. Nonnegative realization of spectra having negative real parts. Linear Algebra Appl. 2006, 416, 148–159. [Google Scholar] [CrossRef] [Green Version]
  18. Leslie, P.H. Some further notes on the use of matrices in population mathematics. Biometrika 1948, 35, 213–245. [Google Scholar] [CrossRef]
  19. 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]
  20. 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]
  21. Butcher, J.C.; Chartier, P. The effective order of singly-implicit Runge-Kutta. Numer. Algorithms 1999, 20, 269–284. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Medina, L.; Nina, H.; Valero, E. A Note on NIEP for Leslie and Doubly Leslie Matrices. Mathematics 2020, 8, 559. https://doi.org/10.3390/math8040559

AMA Style

Medina L, Nina H, Valero E. A Note on NIEP for Leslie and Doubly Leslie Matrices. Mathematics. 2020; 8(4):559. https://doi.org/10.3390/math8040559

Chicago/Turabian Style

Medina, Luis, Hans Nina, and Elvis Valero. 2020. "A Note on NIEP for Leslie and Doubly Leslie Matrices" Mathematics 8, no. 4: 559. https://doi.org/10.3390/math8040559

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop