Algorithmic characterization of pentadiagonal ASSR matrices

ABSTRACT

A matrix is sign regular if all its minors of the same order are of the same sign. A very important subclass of sign regular matrices is formed by those matrices whose non-trivial minors are non-zero. These matrices are called almost strictly sign regular matrices. In this work, an algorithmic characterization of pentadiagonal almost strictly sign regular matrices is presented.

KEYWORDS:

• Pentadiagonal matrices
• almost strictly sign regular matrices
• algorithmic characterization

2010 MATHEMATICS SUBJECT CLASSIFICATION:

• 15B35

Disclosure statement

No potential conflict of interest was reported by the author.

ORCID

P. Alonso http://orcid.org/0000-0001-5222-4522

Additional information

Funding

This work has been partially supported by the Spanish Research Grant PGC2018-096321-B-100, TIN2017-87600-P and MTM2017-90682-REDT.