Matrix completion problems for pairs of related classes of matrices.

DOI10.1016/S0024-3795(02)00531-1zbMath1048.15014MaRDI QIDQ1414126

Leslie Hogben

Publication date: 19 November 2003

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

zbMATH Keywords

graphdigraphmatrix completionpartial matrixcompletion problemspatternP-matrixinverse M-matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On completion problems for various classes of \(P\)-matrices ⋮ Unnamed Item ⋮ The positive Q-matrix completion problem ⋮ The Q0-matrix completion problem ⋮ Completion of Hankel partial contractions of extremal type

Cites Work

• Unnamed Item
• The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
• Positive definite completions of partial Hermitian matrices
• Completions of \(M\)-matrix patterns
• Inverse M-matrices
• The symmetric inverse \(M\)-matrix completion problem
• Parallel concepts in graph theory
• \(P\)-matrix completions under weak symmetry assumptions
• Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
• Completions of inverse \(M\)-matrix patterns
• The completion problem for \(M\)-matrices and inverse \(M\)-matrices
• The P_0-matrix completion problem
• Matrix Analysis
• The combinatorially symmetric P-matrix completion problem
• Completions of P-matrix patterns
• Graph theoretic methods for matrix completion problems

This page was built for publication: Matrix completion problems for pairs of related classes of matrices.