On inverse eigenvalue problems for two kinds of special banded matrices

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 371-385 ◽  
Author(s):  
Wei-Ru Xu ◽  
Guo-Liang Chen
Keyword(s):  
Eigenvalue Problems ◽  
Sufficient Conditions ◽  
Numerical Algorithms ◽  
Tridiagonal Matrices ◽  
Inverse Eigenvalue Problems ◽  
Banded Matrices ◽  
Inverse Eigenvalue ◽  
Maximal Eigenvalues ◽  
Principal Submatrices ◽  
Necessary And Sufficient

This paper presents two kinds of symmetric tridiagonal plus paw form (hereafter TPPF) matrices, which are the combination of tridiagonal matrices and bordered diagonal matrices. In particular, we exploit the interlacing properties of their eigenvalues. On this basis, the inverse eigenvalue problems for the two kinds of symmetric TPPF matrices are to construct these matrices from the minimal and the maximal eigenvalues of all their leading principal submatrices respectively. The necessary and sufficient conditions for the solvability of the problems are derived. Finally, numerical algorithms and some examples of the results developed here are given.

scholarly journals Inverse multiparameter eigenvalue problems for matrices II

1986 ◽  
Vol 29 (3) ◽  
pp. 343-348 ◽  
Author(s):  
Patrick J. Browne ◽  
B. D. Sleeman
Keyword(s):  
Fixed Point ◽  
Eigenvalue Problems ◽  
Symmetric Matrix ◽  
Sufficient Conditions ◽  
Degree Theory ◽  
Main Tool ◽  
Real Numbers ◽  
Inverse Eigenvalue Problems ◽  
Inverse Eigenvalue ◽  
The One

This is a sequel to our previous paper [4] where we initiated a study of inverse eigenvalue problems for matrices in the multiparameter setting. The one parameter version of the problem under consideration asks for conditions on a given n × n symmetric matrix A and on n given real numbers s1≦s2≦…≦sn under which a diagonal matrix V can be found so that A + V has sl,…,sn as its eigenvalues. Our motivation for this problem and our method of attack on it in [4]p comes chiefly from the work of Hadeler [5] in which sufficient conditions were given for existence of the desired diagonal V. Hadeler's approach in [5] relied heavily on the Brouwer fixed point theorem and this was also our main tool in [4]. Subsequently, using properties of topological degree, Hadeler [6] gave somewhat different conditions for the existence of the diagonal V. It is our desire here to follow this lead and to use degree theory to give some results extending those in [6] to the multiparameter case.

scholarly journals Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede

2018 ◽  
Vol 6 (1) ◽  
pp. 77-92 ◽  
Author(s):  
Debashish Sharma ◽  
Mausumi Sen
Keyword(s):  
Eigenvalue Problem ◽  
Recurrence Relations ◽  
Eigenvalue Problems ◽  
Inverse Eigenvalue Problem ◽  
Characteristic Polynomials ◽  
Inverse Eigenvalue Problems ◽  
Inverse Eigenvalue ◽  
Principal Submatrices ◽  
Arrow Matrix ◽  
New System

Abstract The reconstruction of a matrix having a pre-defined structure from given spectral data is known as an inverse eigenvalue problem (IEP). In this paper, we consider two IEPs involving the reconstruction of matrices whose graph is a special type of tree called a centipede. We introduce a special type of centipede called dense centipede.We study two IEPs concerning the reconstruction of matrices whose graph is a dense centipede from given partial eigen data. In order to solve these IEPs, a new system of nomenclature of dense centipedes is developed and a new scheme is adopted for labelling the vertices of a dense centipede as per this nomenclature . Using this scheme of labelling, any matrix of a dense centipede can be represented in a special form which we define as a connected arrow matrix. For such a matrix, we derive the recurrence relations among the characteristic polynomials of the leading principal submatrices and use them to solve the above problems. Some numerical results are also provided to illustrate the applicability of the solutions obtained in the paper.

scholarly journals Extremal Inverse Eigenvalue Problem for a Special Kind of Matrices

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Zhibing Liu ◽  
Yeying Xu ◽  
Kanmin Wang ◽  
Chengfeng Xu
Keyword(s):  
Eigenvalue Problem ◽  
Special Kind ◽  
Inverse Eigenvalue Problem ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Inverse Eigenvalue ◽  
Maximal Eigenvalues ◽  
Principal Submatrices ◽  
Necessary And Sufficient ◽  
Arrow Matrix

We consider the following inverse eigenvalue problem: to construct a special kind of matrix (real symmetric doubly arrow matrix) from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. Our results are constructive and they generate algorithmic procedures to construct such matrices.

scholarly journals A Generalized Inexact Newton Method for Inverse Eigenvalue Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Weiping Shen
Keyword(s):  
Newton Method ◽  
Quadratic Convergence ◽  
Eigenvalue Problems ◽  
Generalized Newton Method ◽  
Inexact Newton Method ◽  
Numerical Tests ◽  
Inverse Eigenvalue Problems ◽  
Inverse Eigenvalue ◽  
Generalized Newton ◽  
Special Case

We propose a generalized inexact Newton method for solving the inverse eigenvalue problems, which includes the generalized Newton method as a special case. Under the nonsingularity assumption of the Jacobian matrices at the solutionc*, a convergence analysis covering both the distinct and multiple eigenvalue cases is provided and the quadratic convergence property is proved. Moreover, numerical tests are given in the last section and comparisons with the generalized Newton method are made.

scholarly journals An inexact Cayley transform method for inverse eigenvalue problems

2004 ◽  
Vol 20 (5) ◽  
pp. 1675-1689 ◽  
Author(s):  
Zheng-Jian Bai ◽  
Raymond H Chan ◽  
Benedetta Morini
Keyword(s):  
Eigenvalue Problems ◽  
Cayley Transform ◽  
Transform Method ◽  
Inverse Eigenvalue Problems ◽  
Inverse Eigenvalue
Sign in / Sign up

Export Citation Format

Share Document