The nonnegative P_0-matrix completion problem
Loading...
Date
2014
Authors
Kivunge, B.
Ji Young Choi
Luz Maria DeAlba
Leslie Hogben
Sandra K. Nordstrom
Mike Shedenhelm
Journal Title
Journal ISSN
Volume Title
Publisher
International Linear Algebra Society
Abstract
In this paperthe nonnegative P0-matrix completion problem is considered. It is shown that a pattern for 4 × 4 matrices that includes all diagonal positions has nonnegative P0- completion if and only if its digraph is complete when it has a 4-cycle. It is also shown that any positionally symmetric pattern that includes all diagonal positions and whose graph is an n-cycle has nonnegative P0-completion if and only if n = 4.
Description
Keywords
Matrix completion, P0-matrix, Nonnegative P0-matrix, L-digraph, n-cycle
Citation
Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 10, pp. 46-59, March 2003