Repositorio
Cómo publicar
Recursos
FAQs

Mostrar el registro sencillo del ítem

Algorithmic characterization of pentadiagonal ASSR matrices

dc.contributor.authorAlonso Velázquez, Pedro 
dc.contributor.authorPeña Ferrández, Juan Manuel
dc.contributor.authorSerrano Ortega, María Luisa 
dc.date.accessioned2020-01-16T07:42:58Z
dc.date.available2020-01-16T07:42:58Z
dc.date.issued2020-01
dc.identifier.citationInternational Journal of Computer Mathematics, 97(1-2), p. 431-443 (2019); doi:10.1080/00207160.2019.1642470
dc.identifier.urihttp://hdl.handle.net/10651/53590
dc.description.abstractAmatrix 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.spa
dc.description.sponsorshipThis work has been partially supported by the Spanish Research Grant PGC2018-096321-B-100, TIN2017-87600-P and MTM2017-90682-REDT.
dc.format.extentp. 431-443
dc.language.isoengspa
dc.publisherTaylor & Francisspa
dc.relation.ispartofInternational Journal of Computer Mathematicsspa
dc.rights© 2020 Informa UK Limited
dc.subjectPentadiagonal matricesspa
dc.subjectalmost strictly sign regular matricesspa
dc.subjectAlgorithmic characterizationspa
dc.titleAlgorithmic characterization of pentadiagonal ASSR matricesspa
dc.typejournal articlespa
dc.identifier.doi10.1080/00207160.2019.1642470
dc.relation.projectIDPGC2018-096321-B-100
dc.relation.projectIDTIN2017-87600-P
dc.relation.projectIDMTM2017-90682-REDT
dc.relation.publisherversionhttp://dx.doi.org/10.1080/00207160.2019.1642470
dc.rights.accessRightsembargoed accessspa


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem