Direct decomposition of m(λ) matrices for hamiltonian systems
✍ Scribed by Krall, A. M.
- Book ID
- 121448603
- Publisher
- Taylor and Francis Group
- Year
- 1991
- Tongue
- English
- Weight
- 285 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0003-6811
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Generalizing a result of Todorčević, we prove the existence of directed sets D, E such that D ≥ Pκλ and E ≥ Pκλ but D × E ≥ Pκλ in the Tukey ordering. As an application, we show that the tree property for directed sets introduced by Hinnion is not preserved under products.
Agler, Helton, McCullough, and Rodman proved that a graph is chordal if and only if any positive semidefinite (PSD) symmetric matrix, whose nonzero entries are specified by a given graph, can be decomposed as a sum of PSD matrices corresponding to the maximal cliques. This decomposition is recently