Loading...
Asymmetric TP and TN completion problems
Johnson, Charles R. ; Wei, Zhen
Johnson, Charles R.
Wei, Zhen
Abstract
We first give a complete list of polynomial conditions on the data for TP (TN) completability of partial TP (TN) matrices with just one or two unspecified entries in either or both of the upper right or lower left entries. These results are used to identify which such patterns, and related patterns, are TP (TN) completable. Then, the TN completable echelon and TP completable jagged patterns are characterized. This generalizes earlier work on combinatorially symmetric TN completable patterns. (C) 2012 Elsevier Inc. All rights reserved.
Description
Date
2013-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Johnson, C. R., & Wei, Z. (2013). Asymmetric TP and TN completion problems. Linear Algebra and its Applications, 438(5), 2127-2135.
Advisor
Department
Mathematics
DOI
10.1016/j.laa.2012.11.008
