Robust characteristic polynomial assignment
✍ Scribed by H. Rotstein; R. Sanchez Peña; J. Bandoni; A. Desages; J. Romagnoli
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 461 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It is well known that the application of the Mappin, 0 Theorem for determining the stability of characteristic polynomials with multilinear coefficients yields conservative results. We show that if the exposed twodimensional faces of the overbounding polytope, (obtained by enclosing the region repre
The characteristic polynomial of a graph G is defined as det(xI -A), where I is the identity matrix and A is the adjacency matrix of G. Based on reduction procedures, we show that the characteristic polynomial of a catacondensed system can be obtained from a product of 5 × 5 matrices with integer co