The matrix completion problem regarding various classes of P0,1- matrices

Abstract

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

The Q0-matrix completion problem

“…In the last few years, research is done for different classes of matrices in the area of Matrix Completion Problems. Several researchers have developed many results of matrix completion problems for different classes of matrices including P and P 0 , Q-matrices (e.g., [2][3][4][5]7,8,10,14]). To see the details of the definition and properties of different classes of partial matrices (i.e P; P 0 or Q-partial matrices) and results regarding matrix completion problems, we suggest [9].…”

The Q1-matrix completion problem

“…A number of researchers studied matrix completion problems for different classes of matrices ( [5][6][7][8][9][10]). The P 0 -matrix and P 0,1 -completion are studied in [7,11]. A real n × n matrix B 1 is a P 0 -matrix (P-matrix) if every principal minor of B 1 is nonnegative (positive).…”