Which assignments from 2n-1 arbitrary, distinct real numbers as eigenvalues of designated leading principal submatrices permit a real symmetric tridiagonal matrix? We raise this question, motivated both by known results and recent work on multiplicities and interlacing equalities in symmetric matrices whose graph is a given tree. Known results are reviewed, a general conjecture is given, and several new partial results are proved. (C) 2015 Elsevier Inc. All rights reserved
Abstract. Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetr...
summary:An explicit formula for the deflation of a tridiagonal matrix is presented. The resulting ma...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
Which assignments from 2n-1 arbitrary, distinct real numbers as eigenvalues of designated leading pr...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is ...
AbstractGiven a set of 2n real numbers λ1<λ2<⋯<λ2n, the authors describe the set {S} of n × n tridia...
AbstractThe problem of generating a matrix A with specified eigenpairs, where A is a tridiagonal sym...
AbstractIt is proved that a real symmetric tridiagonal matrix with positive codiagonal elements is u...
AbstractLower bounds for the number of different real eigenvalues as well as for the number of real ...
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number o...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
How much can be said about the location of the eigenvalues of a symmetric tridiagonal matrix just by...
Elsner L, Hershkowitz D. On the spectra of close-to-Schwarz matrices. In: Linear Algebra and its Ap...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
Abstract. Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetr...
summary:An explicit formula for the deflation of a tridiagonal matrix is presented. The resulting ma...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
Which assignments from 2n-1 arbitrary, distinct real numbers as eigenvalues of designated leading pr...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is ...
AbstractGiven a set of 2n real numbers λ1<λ2<⋯<λ2n, the authors describe the set {S} of n × n tridia...
AbstractThe problem of generating a matrix A with specified eigenpairs, where A is a tridiagonal sym...
AbstractIt is proved that a real symmetric tridiagonal matrix with positive codiagonal elements is u...
AbstractLower bounds for the number of different real eigenvalues as well as for the number of real ...
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number o...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
How much can be said about the location of the eigenvalues of a symmetric tridiagonal matrix just by...
Elsner L, Hershkowitz D. On the spectra of close-to-Schwarz matrices. In: Linear Algebra and its Ap...
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is p...
Abstract. Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetr...
summary:An explicit formula for the deflation of a tridiagonal matrix is presented. The resulting ma...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
Add to ORKG