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

Hello everyone,

Are there any known conditions to ensure that the singular value of a matrix A is smaller than 1 ? More specifically, in my case A is the product of an M-Matrix and an inverse M-Matrix, if it can help in any way. I haven't found anything yet.

Thank you for your help

share|cite|improve this question
Do you mean all the singular values, I assume? – Federico Poloni Jan 16 '12 at 18:30
If elements are quite small, then sing.vals. will be small, it can be made precise... but is what you are looking for ? – Alexander Chervov Jan 16 '12 at 18:45
I am seeing votes to close, but no comments with reasons. At any rate, if you don't feel like explaining what an M-matrix is, you might have better luck on – S. Carnahan Jan 17 '12 at 3:28
Sorry for being imprecise. I am interested in the largest singular value only. An M-Matrix has mainly two properties : 1- all non diagonal entries are negative 2- all principal minors are positive A sufficient condition to check that a matrix is an M-Matrix is that it can be written (\lambda I - B) for some nonnegative matrix B and some \lambda > p, where p is a maximal eigenvalue of B. A property of an M-Matrix is that all the eigenvalues are positive. I don't know if these properties can help. But yes, I am trying to find conditions to ensure that the largest s.v. is < 1. Thanks, – user20638 Jan 17 '12 at 20:38
To Alexander Chervov (or anyone else who knows), You say that "If elements are quite small, then sing.vals. will be small, it can be made precise". How can it "be made precise" ? I would be interested to know more (I am not myself mathematician). In my case, the elements of A are all smaller that between -1 and 1. Don't know if it helps... Thank you. – user20638 Jan 20 '12 at 21:56

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.