Completely-S matrix
Snapshot
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
Notes
Text derived from https://en.wikipedia.org/w/index.php?oldid=1285634213 under CC BY-SA 4.0; modifications have been made.