Combinatorial matrix analysis: An overview (Q1106910)
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 4063266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial matrix analysis: An overview |
scientific article; zbMATH DE number 4063266 |
Statements
Combinatorial matrix analysis: An overview (English)
0 references
1988
0 references
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.
0 references
bounding of matrix parameters
0 references
attenuation of matrix products
0 references
combinatorial matrix analysis
0 references
qualitative matrix theory
0 references
matrix completion problems
0 references
matrix parameter inequalities
0 references
longest simple circuit in spectral analysis
0 references
Hadamard-like products
0 references
0 references
0.7498210072517395
0 references
0.7494057416915894
0 references
0.7452716827392578
0 references
