Extremal inverse eigenvalue problem for irreducible acyclic matrices
In this paper, we study the inverse eigenvalue problem of constructing symmetric matrices whose graph is a tree, i.e. of constructing irreducible acyclic matrices from given eigendata consisting of the smallest and largest eigenvalues of their leading principal submatrices. We solve the problem comp...
में बचाया:
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Taylor & Francis Group
2022-12-01
|
| श्रृंखला: | Applied Mathematics in Science and Engineering |
| विषय: | |
| ऑनलाइन पहुंच: | http://dx.doi.org/10.1080/27690911.2022.2041631 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|