Title
Almost strictly totally negative matrices: An algorithmic characterization.
Abstract
A real matrix A=(aij)1≤i,j,≤n is said to be almost strictly totally negative if it is almost strictly sign regular with signature ε=(−1,−1,…,−1), which is equivalent to the property that all its nontrivial minors are negative. In this paper an algorithmic characterization of nonsingular almost strictly totally negative matrices is presented.
Year
DOI
Venue
2015
10.1016/j.cam.2014.07.027
Journal of Computational and Applied Mathematics
Keywords
DocType
Volume
65F05,15A48,65F40
Journal
275
Issue
ISSN
Citations 
C
0377-0427
2
PageRank 
References 
Authors
0.41
4
3
Name
Order
Citations
PageRank
Pedro Alonso1266.31
Juan Manuel Peña213126.55
María Luisa Serrano362.66