MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose I have a tridiagonal square matrix $A$ of some nice form, for which I know the eigenvalues $\lambda_1<\dots<\lambda_n$. $A$ is also essentially nonnegative (nonnegative everywhere except main diagonal).

What can I say about the sum of $A$ and a diagonal matrix $B=\text{diag}(x_1,\dots,x_n)$, for which I know only about sum of it's elements?

Some equalities, maybe inequalities with eigenvalues of the first matrix and values of the second? Special interest is in the maximal eigenvalue

share|cite|improve this question
I'm not sure I understand the question completely, but the SUM of the diagonal entries certainly can't give anything (in general) on individual eigenvalues ($A=0$). – Christian Remling Apr 27 '14 at 23:38
assuming a symmetric tridiagonal, isn't the majorization relation $\lambda(A+B)\prec \lambda(A)+\lambda(B)$ sufficient? – Suvrit Apr 28 '14 at 0:34
@ChristianRemling that is all I know: $A$ is tridiagonal, $B=\text{diag}(x_1,\dots,x_n),\ \sum_{1}^{n} x_i = R$. But any interesting inequality which contain x_i and eigenvalues of $A$ would be a great step for me too – Daniel Apr 29 '14 at 1:09
@Suvrit I wonder if there is some more interesting property based on tridiagonality and nonnegativity of $A$ and diagonality of $B$ – Daniel Apr 29 '14 at 1:17

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.