Graph theoretic methods for matrix completion problems

DOI10.1016/S0024-3795(00)00299-8MaRDI QIDQ5935567zbMATH OpenOpenAlexFDO

Authors Leslie Hogben

Publication date 31 October 2002

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0024-3795(00)00299-8

zbMATH Keywords

\(M\)-matrices\(P\)-matrices\(P_0\)-matricescompletion of matricesgraphsinversespartial matrixpositive definite matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 4158856
• scientific article; zbMATH DE number 2144792
• The totally positive completion problem
• Completions of partial \(P\)-matrices with acyclic or non-acyclic associated graph
• Completions of partial Jordan and Hessenberg matrices

Cites work

• \(P\)-matrix completions under weak symmetry assumptions
• Completions of \(M\)-matrix patterns
• Completions of inverse M-matrix patterns
• Completions of P-matrix patterns
• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
• Inverse M-matrices
• Matrix Analysis
• Positive definite completions of partial Hermitian matrices
• Sub-direct sums and positivity classes of matrices
• The combinatorially symmetric P-matrix completion problem
• The completion problem for M-matrices and inverse M-matrices
• The positive definite completion problem relative to a subspace
• The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
• The symmetric inverse M-matrix completion problem

Cited in

(20)

• Combinatorial matrix analysis: An overview
• Matrix completions and chordal graphs
• Matrix completion problems for pairs of related classes of matrices.
• The doubly negative matrix completion problem
• On Fiedler's characterization of tridiagonal matrices over arbitrary fields
• Matrix completions for linear matrix equations
• Computational graph completion
• The positive Q-matrix completion problem
• Adjacent edge conditions for the totally nonnegative completion problem
• scientific article; zbMATH DE number 1375600 (Why is no real title available?)
• Methodology for Stochastic Graph Completion-Time Problems
• The nonnegative Q-matrix completion problem
• Research problem: The completion number of a graph
• scientific article; zbMATH DE number 7653014 (Why is no real title available?)
• Contractive symmetric matrix completion problems related to graphs
• The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
• On completion problems for various classes of \(P\)-matrices
• The positive definite completion problem revisited
• Extending partial tournaments
• The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems

This page was built for publication: Graph theoretic methods for matrix completion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935567)