Matrix completion problem
Date
2017
Authors
Tomno
Journal Title
Journal ISSN
Volume Title
Publisher
Strathmore University
Abstract
A real n n matrix is a nonnegative P0-matrix if its principal minors are nonnegative and all its entriesare nonnegative. A digraph D is said to have nonnegative P0-matrix completion if every partial nonnegative P0-matrix specifying D can be completed to a nonnegative P0- matrix.In this paper we study nonnegative P0-matrix completion for p=6 vertices with q=6 directed arcs where sufficient conditions fora digraph to have nonnegative P0 completion are given and necessary conditions for a digraph to have nonnegative P0-completion are provided.
Description
Paper presented at the 4th Strathmore International Mathematics Conference (SIMC 2017), 19 - 23 June 2017, Strathmore University, Nairobi, Kenya.
Keywords
Matrix completion, Non-negative matrix completion, Directed graphs, Po Matrix completion