On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
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 p...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000400811 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|