An explicit algorithm constructs strict sign regular matrices of every size and every sign pattern, together with insertion and border-extension theorems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Constructing strictly sign regular matrices of all sizes and sign patterns
An explicit algorithm constructs strict sign regular matrices of every size and every sign pattern, together with insertion and border-extension theorems.