Matrix completion problem
Matrix completion problem
Paper presented at the 4th Strathmore International Mathematics Conference (SIMC 2017), 19 - 23 June 2017, Strathmore University, Nairobi, Kenya. 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. Moi University, Eldoret, Kenya
- Strathmore University Kenya
Matrix completion, Non-negative matrix completion, Po Matrix completion, Directed graphs
Matrix completion, Non-negative matrix completion, Po Matrix completion, Directed graphs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!