On sufficient and necessary conditions for the Jacobi matrix inverse eigenvalue problem

2004 ◽  
Vol 98 (1) ◽  
pp. 167-176 ◽  
Author(s):  
Linzhang Lu ◽  
Michael K. Ng
Author(s):  
Somayeh Zangoei Zadeh ◽  
Azim Rivaz

In this paper, we present a method for constructing a Jacobi matrix [Formula: see text] using [Formula: see text] known eigenvalues [Formula: see text]. Some conditions are also given under which the constructed matrix is nonnegative and its diagonal entries are specified. Finally, we present a technique for constructing symmetric and nonsymmetric nonnegative matrices by their eigenvalues.


2001 ◽  
Vol 26 (9) ◽  
pp. 513-523 ◽  
Author(s):  
Kazem Ghanbari

We study a generalized inverse eigenvalue problem (GIEP),Ax=λBx, in whichAis a semi-infinite Jacobi matrix with positive off-diagonal entriesci>0, andB= diag (b0,b1,…), wherebi≠0fori=0,1,…. We give an explicit solution by establishing an appropriate spectral function with respect to a given set of spectral data.


2021 ◽  
Vol 2068 (1) ◽  
pp. 012014
Author(s):  
Hongliang Huang ◽  
Qike Wang ◽  
Zhibin Li ◽  
Lidong Wang

Abstract This paper studies the inverse eigenvalue problem for an arrow-shaped generalised Jacobi matrix, inverting matrices through two eigen-pairs. In the paper, the existence and uniqueness of the solution to the problem are discussed, and mathematical expressions as well as a numerical example are given. Finally, the uniqueness theorem of its matrix is established by mathematical derivation.


2011 ◽  
Vol 2011 ◽  
pp. 1-11
Author(s):  
Zhengsheng Wang ◽  
Baojiang Zhong

A kind of inverse eigenvalue problem is proposed which is the reconstruction of a Jacobi matrix by given four or five eigenvalues and corresponding eigenvectors. The solvability of the problem is discussed, and some sufficient conditions for existence of the solution of this problem are proposed. Furthermore, a numerical algorithm and two examples are presented.


Sign in / Sign up

Export Citation Format

Share Document