Graph theoretic methods for matrix completion problems (Q5935567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1610661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph theoretic methods for matrix completion problems |
scientific article; zbMATH DE number 1610661 |
Statements
Graph theoretic methods for matrix completion problems (English)
0 references
31 October 2002
0 references
graphs
0 references
completion of matrices
0 references
partial matrix
0 references
positive definite matrices
0 references
\(P_0\)-matrices
0 references
\(M\)-matrices
0 references
inverses
0 references
\(P\)-matrices
0 references
A partial matrix is a matrix in which some entries are specified and others are not. A completion of a partial matrix is a specific choice of values for the unspecified entries.NEWLINENEWLINENEWLINEThe author presents a survey of the research concerning the completion problems together with several new results. He deals with a lot of classes of matrices as positive definite matrices, \(P_0\)-matrices, \(M\)-matrices and their inverses, \(P\)-matrices. Essentially the employed methods are those of graph theory. The exposition is clarified by examples and summarized by tables.
0 references
0.8452068567276001
0 references
0.8386935591697693
0 references
0.8386930823326111
0 references
