Indexed by:
Abstract:
A matrix is called a complex-L matrix if its complex sign pattern implies that it is of full column rank. The definition is a generalization of L-matrices from the real field to the complex field. The recognition problem of complex-L matrices is studied in this paper; a combinatorial characterization of complex-L matrices is given, showing that the problem of recognizing complex-L matrices is in the class co-NP-complete. It is also shown that this recognition problem can be reduced to its subproblem for which each entry of the matrices is either real or pure imaginary. © 2014 Elsevier B.V. All rights reserved.
Keyword:
Reprint 's Address:
Email:
Source :
Discrete Mathematics
ISSN: 0012-365X
Year: 2014
Issue: 1
Volume: 322
Page: 31-35
0 . 5 5 7
JCR@2014
0 . 7 0 0
JCR@2023
ESI HC Threshold:86
JCR Journal Grade:3
CAS Journal Grade:4
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: