Completing triangular block matrices with maximal and minimal ranks Original Research Article

This paper considers two completion problems on block matrices with maximal and minimal ranks: Let A=(Aij) be an n×n block matrix, where Aij (ngreater-or-equal, slantedigreater-or-equal, slantedjgreater-or-equal, slanted1) is given, and Aij (1less-than-or-equals, slanti