Repository
How to publish
Resources
FAQs

Algorithmic characterization of pentadiagonal ASSR matrices

Author:
Alonso Velázquez, PedroUniovi authority; Peña Ferrández, Juan Manuel; Serrano Ortega, María LuisaUniovi authority
Subject:

Pentadiagonal matrices

almost strictly sign regular matrices

Algorithmic characterization

Publication date:
2020-01
Editorial:

Taylor & Francis

Publisher version:
http://dx.doi.org/10.1080/00207160.2019.1642470
Citación:
International Journal of Computer Mathematics, 97(1-2), p. 431-443 (2019); doi:10.1080/00207160.2019.1642470
Descripción física:
p. 431-443
Abstract:

Amatrix 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.

Amatrix 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.

URI:
http://hdl.handle.net/10651/53590
DOI:
10.1080/00207160.2019.1642470
Patrocinado por:

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

Collections
Files in this item
Métricas
Compartir
Estadísticas de uso
Estadísticas de uso
Metadata
Show full item record