0
$\begingroup$

Does anybody know the inequality of singular value for differences of matrices, i.e.

$\sigma_{max}\left(\begin{array}{c} A-B\end{array}\right)\leq??$

in term of $\sigma_{max}\left(\begin{array}{c} A\end{array}\right)$, $\sigma_{min}\left(\begin{array}{c} A\end{array}\right)$, $\sigma_{max}\left(\begin{array}{c} B\end{array}\right)$, or $\sigma_{min}\left(\begin{array}{c} B\end{array}\right)$

A and B are not Hermitian though.

$\endgroup$
4
  • $\begingroup$ Is $\bar \sigma$ the spectral radius? $\endgroup$
    – Fabian
    Commented Jan 8, 2013 at 19:25
  • $\begingroup$ It is a norm, hence any norm inequality applies? $\endgroup$
    – copper.hat
    Commented Jan 8, 2013 at 19:29
  • $\begingroup$ It is the maximum singular value, I presume. $\endgroup$
    – copper.hat
    Commented Jan 8, 2013 at 19:29
  • $\begingroup$ I have edited the question, yes, it's singular value $\endgroup$
    – aning
    Commented Jan 8, 2013 at 19:35

1 Answer 1

Reset to default
2
$\begingroup$

Recall that $\sigma_\max(M)=\max_{\|x\|=1}\|Mx\|$. By triangular inequality, clearly we have $\sigma_\max(A-B)\le\sigma_\max(A)+\sigma_\max(B)$.

$\endgroup$
2
  • $\begingroup$ Thanks, but I need the tighter one, We know that $\sigma_{max}\left(\begin{array}{c} A\end{array}-B\right)\geq\max\left\{ \sigma_{max}\left(\begin{array}{c} A\end{array}\right),\sigma_{max}\left(\begin{array}{c} B\end{array}\right)\right\} -\min\left\{ \sigma_{min}\left(\begin{array}{c} A\end{array}\right),\sigma_{min}\left(\begin{array}{c} B\end{array}\right)\right\} $ Perhaps there's inequality like that for the upper bound? $\endgroup$
    – aning
    Commented Jan 8, 2013 at 19:42
  • 1
    $\begingroup$ @RahayuPrihatin Admittedly, this one is not very useful, but it is tight. For instance, $\sigma_\max(I-(-I))=2=\sigma_\max(I)+\sigma_\max(-I)$. $\endgroup$
    – user1551
    Commented Jan 8, 2013 at 20:11

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .