Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/11300
DC FieldValueLanguage
dc.contributor.authorFonseca, C. M. da-
dc.contributor.authorMamede, Ricardo-
dc.date.accessioned2009-09-07T10:02:10Z-
dc.date.available2009-09-07T10:02:10Z-
dc.date.issued2007-
dc.identifier.citationPré-Publicações DMUC. 07-13 (2007)en_US
dc.identifier.urihttps://hdl.handle.net/10316/11300-
dc.description.abstractA matrix whose entries are +, ¡ or 0 is said a sign pattern. The inertia set of an n-by-n symmetric sign pattern A is the set of inertias of all real symmetric matrices with the same sign pattern as A. We present an algorithm to compute the inertia set of any symmetric tree (or acyclic) sign pattern. The procedure generalizes some recent results. Some examples are provided.en_US
dc.description.sponsorshipCentro de Matemática da Universidade Coimbraen_US
dc.language.isoengen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.rightsopenAccesseng
dc.subjectInertiaen_US
dc.subjectSign pattern matrixen_US
dc.subjectTridiagonal patternen_US
dc.subjectTreesen_US
dc.subjectStarsen_US
dc.subjectDouble starsen_US
dc.subject2-generalized starsen_US
dc.titleAn algorithm for the inertia sets of tree sign patternsen_US
dc.typepreprinten_US
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_816b-
item.fulltextCom Texto completo-
item.openairetypepreprint-
item.cerifentitytypePublications-
item.languageiso639-1en-
Appears in Collections:FCTUC Matemática - Vários
Files in This Item:
File Description SizeFormat
An algorithm for the inertia sets of tree sign patterns.pdf161.81 kBAdobe PDFView/Open
Show simple item record

Page view(s) 50

497
checked on Oct 29, 2024

Download(s)

86
checked on Oct 29, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.