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 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|