๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Characteristic polynomial of catacondensed systems

โœ Scribed by Juan Rada

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
138 KB
Volume
367
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 coefficient polynomial entries.

๐Ÿ“œ SIMILAR VOLUMES

Feedback characteristic polynomial contr
Feedback characteristic polynomial controller design of 3-D systems in state-space
โœ S.G. Tzafestas; T.G. Pimenides ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 956 KB

For a general state-space model of three-dimensional (3-D) systems the characteristic polynomial (eigenvalue) control problem via state and output feedback is considered. A frequency domain approach is employed which in the scalar input case leads to a set of necessary and suficient conditions. The

Evaluation of the characteristic polynom
Evaluation of the characteristic polynomial of a graph
โœ Tomislav P Zฬ†ivkoviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB

Two algorithms for the evaluation of the characteristic polynomial of a graph G are described. Both algorithms have the operation count of the order n3, where n is the number of the vertices in the graph G. These algorithms are stable, fast, and efficient. They are one order of magnitude faster tha