2006
DOI: 10.1016/j.laa.2005.10.007
|View full text |Cite
|
Sign up to set email alerts
|

On completion problems for various classes of P-matrices

Abstract: A P-matrix is a real square matrix having every principal minor positive, and a Fischer matrix is a P-matrix that satisfies Fischer's inequality for all principal submatrices. In this paper, all patterns of positions for n × n matrices, n ≤ 4, are classified as to whether or not every partial Π-matrix can be completed to a Π-matrix for Π any of the classes positive P-, nonnegative P-, or Fischer matrices. Also, all symmetric patterns for 5 × 5 matrices are classified as to completion of partial Fischer matrice… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 11 publications
(26 reference statements)
0
6
0
Order By: Relevance
“…optimization, see, for instance, [19]), electrical engineering (e.g. data transmission, coding and image enhancement, see, for instance, [3]) and geophysics (seismic reconstruction problems, see, for instance, [14]). A Hankel Partial Contraction (HPC) is a square Hankel matrix such that not all of its entries are determined, but in which every well-defined submatrix (completely determined submatrix) is a contraction (in the sense that their operator norms are at most 1).…”
Section: Introductionmentioning
confidence: 99%
“…optimization, see, for instance, [19]), electrical engineering (e.g. data transmission, coding and image enhancement, see, for instance, [3]) and geophysics (seismic reconstruction problems, see, for instance, [14]). A Hankel Partial Contraction (HPC) is a square Hankel matrix such that not all of its entries are determined, but in which every well-defined submatrix (completely determined submatrix) is a contraction (in the sense that their operator norms are at most 1).…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, matrix completion problems arise naturally in (i) probability and statistics (e.g. entropy methods for missing data; see, for instance, [11] and [12]); (ii) chemistry (e.g., the molecular conformation problem [5]); (iii) numerical analysis (e.g., optimization [17]); (iv) electrical engineering (e.g., data transmission, coding and image enhancement; see, for instance, [3]); and (v) geophysics (seismic reconstruction problems [13]).…”
Section: Introductionmentioning
confidence: 99%
“…. 1 DetA and 3x3 principal minors of A in Case 1 Table 4.1 DetA and 3x3 principal minors of A in Case 1 Table 4.2 DetA and 3x3 principal minors of A in Case 2 with e = 0 23 Table 4. 3 DetA and 3x3 principal minors of A in Case 3A Table 4.…”
Section: List Of Tablesmentioning
confidence: 99%
“…A permutation similarity of A is a product PAP~ 1 where P is a permutation matrix. A diagonal similarity of A is a product DAD" 1 where D is a diagonal matrix.…”
Section: List Of Tablesmentioning
confidence: 99%
See 1 more Smart Citation