Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

I'm looking for the name of this kind of $n$-by-$n$ matrix:

$$\left(\begin{array}{cccc} -s_1 & b_{12} & b_{13} & b_{14} \\ b_{21} & -s_2 & b_{23} & b_{24} \\ b_{31} & b_{32} & -s_3 & b_{34} \\ b_{41} & b_{42} & b_{43} & -s_4 \end{array}\right)$$

where $s_i = \sum_{j\neq i} b_{ij}$. This is basically so I can google it, so by name I really mean an appropriate "search string".

share|cite|improve this question
    
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure... – user71815 Jun 12 '13 at 11:29
    
Sounds about right – Lucas Jun 12 '13 at 15:50

We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.

Such matrices are invertible, ie. nonzero determinant.

share|cite|improve this answer

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.