The totally positive completion problem: the 3-by-n case (Q825571)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The totally positive completion problem: the 3-by-n case |
scientific article; zbMATH DE number 7447711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The totally positive completion problem: the 3-by-n case |
scientific article; zbMATH DE number 7447711 |
Statements
The totally positive completion problem: the 3-by-n case (English)
0 references
17 December 2021
0 references
completion problem
0 references
initial minors
0 references
totally positive matrix
0 references
0.90981853
0 references
0.87220967
0 references
0 references
0.85519385
0 references
0.85034037
0 references
0.84900516
0 references
0.8465612
0 references
