On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
Open Access
- 22 October 2019
- journal article
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 38 (4) , 811-828
Abstract
We present a new construction of a symmetric arrow matrix from a particular spectral information: let λ(n) 1 be the minimal eigenvalue of the matrix and λj (j) , j = 1, 2, . . . , n the maximal eigenvalues of all leading principal submatrices of the matrix. We use such a procedure to construct a nonsymmetric arrow matrix from the same spectral information plus to an eigenvector x(n) = (x1, x2, . . . , xn), so that (x(n), λn (n)) is an eigenpair of the matrix. Moreover, our results generate an algorithmic procedure to compute a solution matrix.Keywords
This publication has 12 references indexed in Scilit:
- Extreme Spectra Realization by Nonsymmetric Tridiagonal and Nonsymmetric Arrow MatricesMathematical Problems in Engineering, 2019
- Inverse spectral problems for collections of leading principal submatrices of tridiagonal matricesLinear Algebra and its Applications, 2016
- An efficient method for computing the inverse of arrowhead matricesApplied Mathematics Letters, 2014
- The inverse eigenvalue problem for symmetric quasi anti-bidiagonal matricesApplied Mathematics and Computation, 2011
- Extreme spectra realization by real symmetric tridiagonal and real symmetric arrow matricesThe Electronic Journal of Linear Algebra, 2011
- Extremal inverse eigenvalue problem for bordered diagonal matricesLinear Algebra and its Applications, 2007
- Two inverse eigenvalue problems for a special kind of matricesLinear Algebra and its Applications, 2006
- Inverse Eigenvalue Problems2005
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problemApplied Numerical Mathematics, 1993
- Intramolecular Radiationless TransitionsThe Journal of Chemical Physics, 1968