Combinatorial matrix analysis: An overview
type: Item
instance of: scholarly article
title: Combinatorial matrix analysis: An overview
zbMATH Open document ID: 0652.15001
DOI: 10.1016/0024-3795(88)90233-9
author: Charles R. Johnson
published in: Linear Algebra and its Applications
publication date: 1988-01-01T00:00:00Z
review text: The author surveys recent work in some components of combinatorial matrix analysis, namely, (1) qualitative matrix theory, (2) matrix completion problems, (3) combinatorial aspects of optimization techniques for matrix parameter inequalities, (4) the role of the longest simple circuit in spectral analysis, (5) an attenuation technique for relating Hadamard- like products to the conventional product. The goal here is to offer a definition of topic, some argument for its importance, and a brief survey of some research subjects that fit within it and help to define it. Some definitional thoughts, historical perspectives, and unification of challenges, etc. are offered. It is concluded with a small selection of references that either support the discussion in the text or indicate other areas of combinatorial matrix analysis.
Mathematics Subject Classification ID: 15-02
Mathematics Subject Classification ID: 15A45
Mathematics Subject Classification ID: 15A39
Mathematics Subject Classification ID: 05B20
zbMATH DE Number: 4063266
zbMATH Keywords: bounding of matrix parameters
zbMATH Keywords: attenuation of matrix products
zbMATH Keywords: combinatorial matrix analysis
zbMATH Keywords: qualitative matrix theory
zbMATH Keywords: matrix completion problems
zbMATH Keywords: matrix parameter inequalities
zbMATH Keywords: longest simple circuit in spectral analysis
zbMATH Keywords: Hadamard-like products
MaRDI profile type: Publication
full work available at URL: 0024-3795(88)90233-9
OpenAlex ID: W2032067581
cites work: Determinantal formulae for matrices with sparse inverses
cites work: Spanning-tree extensions of the Hadamard-Fischer inequalities
cites work: Determinantal formulae for matrices with sparse inverses. II: Asymmetric zero patterns
cites work: Inherited Matrix Entries: Principal Submatrices of the Inverse
cites work: Qualitative Economics and the Scope of the Correspondence Principle
cites work: A Semi-Definite Lyapunov Theorem and the Characterization of Tridiagonal D-Stable Matrices
cites work: Positive definite completions of partial Hermitian matrices
cites work: Some Sign Patterns that Preclude Matrix Stability
cites work: When is a Matrix Sign Stable?
cites work: Complex eigenvalues of a non-negative matrix with a specified graph II
cites work: Sign patterns of inverse-positive matrices
cites work: Q3729090
cites work: A surprising determinantal inequality for real matrices
cites work: Sign determinacy of M-matrix minors
cites work: A Class of M-Matrices with Tree Graphs
cites work: M-matrix products having positive principal minors
cites work: Stability ofm-matrix products
cites work: Inertia possibilities for completions of partial hermitian matrices*
cites work: Completion of partial matrices to contractions
cites work: Sign patterns, nonsingularity, and the solvability of Ax=b
cites work: Signsolvability revisited
cites work: Combinatorially symmetric matrices
cites work: On the Eigenvalues and Eigenvectors of a Class of Matrices
description: scientific article; zbMATH DE number 4063266