Publication
An algorithm for the inertia sets of tree sign patterns
| Summary: | A 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. |
|---|---|
| Main Authors: | Fonseca, C. M. da |
| Other Authors: | Mamede, Ricardo |
| Subject: | Inertia Sign pattern matrix Tridiagonal pattern Trees Stars Double stars 2-generalized stars |
| Year: | 2007 |
| Country: | Portugal |
| Document type: | preprint |
| Access type: | open access |
| Associated institution: | Universidade de Coimbra |
| Language: | English |
| Origin: | Estudo Geral - Universidade de Coimbra |
| Summary: | A 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. |
|---|
Funded activities
No funded projects found.