Jump to content

Completely-S matrix

From Wikipedia, the free encyclopedia

In linear algebra, a completely-S matrix is a square matrix such that for every principal submatrix R there exists a positive vector u such that Ru > 0.[1]

Notes

[edit]
  1. ^ Chen, Hong (1996). "A sufficient condition for the positive recurrence of a semimartingale reflecting Brownian motion in an orthant". Annals of Applied Probability. 6 (3): 758–765. doi:10.1214/aoap/1034968226.