• Login
    View Item 
    •   SU+ Home
    • Conferences / Workshops / Seminars +
    • Strathmore International Mathematics Conference
    • SIMC 2017
    • View Item
    •   SU+ Home
    • Conferences / Workshops / Seminars +
    • Strathmore International Mathematics Conference
    • SIMC 2017
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Matrix completion problem

    Thumbnail
    View/Open
    Abstract - SIMC Conference paper, 2017 (15.19Kb)
    Date
    2017
    Author
    Tomno
    Metadata
    Show full item record
    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.
    URI
    http://hdl.handle.net/11071/11829
    Collections
    • SIMC 2017 [85]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of SU+Communities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV