Matrix completion problem
| dc.contributor.author | Tomno | |
| dc.date.accessioned | 2021-05-11T13:08:17Z | |
| dc.date.available | 2021-05-11T13:08:17Z | |
| dc.date.issued | 2017 | |
| dc.description | Paper presented at the 4th Strathmore International Mathematics Conference (SIMC 2017), 19 - 23 June 2017, Strathmore University, Nairobi, Kenya. | en_US |
| dc.description.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. | en_US |
| dc.description.sponsorship | Moi University, Eldoret, Kenya | en_US |
| dc.identifier.uri | http://hdl.handle.net/11071/11829 | |
| dc.language.iso | en | en_US |
| dc.publisher | Strathmore University | en_US |
| dc.subject | Matrix completion | en_US |
| dc.subject | Non-negative matrix completion | en_US |
| dc.subject | Directed graphs | en_US |
| dc.subject | Po Matrix completion | en_US |
| dc.title | Matrix completion problem | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Matrix completion problem.pdf
- Size:
- 15.2 KB
- Format:
- Adobe Portable Document Format
- Description:
- Abstract - SIMC Conference paper, 2017
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: