The nonnegative P_0-matrix completion problem

Simple item page
dc.contributor.authorKivunge, B.
dc.contributor.authorJi Young Choi
dc.contributor.authorLuz Maria DeAlba
dc.contributor.authorLeslie Hogben
dc.contributor.authorSandra K. Nordstrom
dc.contributor.authorMike Shedenhelm
dc.date.accessioned2015-02-17T11:44:57Z
dc.date.available2015-02-17T11:44:57Z
dc.date.issued2014
dc.description.abstractIn 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.en_US
dc.identifier.citationElectronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 10, pp. 46-59, March 2003en_US
dc.identifier.issn1081-3810
dc.identifier.urihttp://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol10_pp46-59.pdf
dc.identifier.urihttp://ir-library.ku.ac.ke/handle/123456789/12249
dc.language.isoenen_US
dc.publisherInternational Linear Algebra Societyen_US
dc.subjectMatrix completionen_US
dc.subjectP0-matrixen_US
dc.subjectNonnegative P0-matrixen_US
dc.subjectL-digraphen_US
dc.subjectn-cycleen_US
dc.titleThe nonnegative P_0-matrix completion problemen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
The nonnegative P_0-matrix completion problem.pdf
Size:
531.1 KB
Format:
Adobe Portable Document Format
Description:
Full text
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
RP-Department of Mathematics