The totally positive completion problem (Q703637): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Cristina Jordán Lluch / rank | |||
Property / author | |||
Property / author: Juan Ramón Torregrosa Sánchez / rank | |||
Property / reviewed by | |||
Property / reviewed by: Rabe-Rüdiger von Randow / rank | |||
Property / author | |||
Property / author: Cristina Jordán Lluch / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Juan Ramón Torregrosa Sánchez / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Rabe-Rüdiger von Randow / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2004.03.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056316047 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Totally positive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4288578 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4400640 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path product matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5624248 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of Matrices with Distinct, Real Characteristic Values / rank | |||
Normal rank |
Latest revision as of 17:11, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The totally positive completion problem |
scientific article |
Statements
The totally positive completion problem (English)
0 references
11 January 2005
0 references
A partial matrix over \(\mathbb{R}\) is a square matrix in which some entries are specified while the remaining ones are free to be chosen from \(\mathbb{R}\), with the additional property that all diagonal entries are prescribed. A completion of a partial matrix is the matrix resulting from a particular choice for the unspecified entries. A matrix completion problem asks the question: does a partial matrix with a certain property have a completion with the same property? Here the authors address the following property: a real square matrix is totally positive if every minor is nonnegative, and a partial matrix is totally positive if every completely specified submatrix is totally positive. As the answer in this case is generally negative, the authors analyze the question: for which labelled graphs \(G\) does every \(n\times n\) totally positive partial matrix whose associated graph (\(n\) vertices and edges corresponding to the specified off-diagonal elements) is \(G\), have a totally positive completion? The authors consider partial matrices whose \((i,j)\)-entry is specified if and only if its \((j,i)\)-entry is, which thus have undirected \(G\). When \(G\) is a path or a cycle, they give necessary and sufficient conditions for a positive answer.
0 references
Partial matrix
0 references
Completion problem
0 references
Totally positive matrix
0 references
Undirected graphs
0 references