
doi: 10.1007/bf02432001
An algorithmic characterization of almost strictly totally positive matrices by Neville elimination is given. Moreover, a determinantal characterization of them is proved in terms of the positivity of a very reduced number of their minors and also in terms of their factorizations.
Positive matrices and their generalizations; cones of matrices, almost strictly totally positive matrices, determinantal characterization, factorizations, algorithmic characterization, Neville elimination
Positive matrices and their generalizations; cones of matrices, almost strictly totally positive matrices, determinantal characterization, factorizations, algorithmic characterization, Neville elimination
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 23 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
