Extremal inverse eigenvalue problem for a special kind of matrices
From MaRDI portal
Summary: We consider the following inverse eigenvalue problem: to construct a special kind of matrix (real symmetric doubly arrow matrix) from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. Our results are constructive and they generate algorithmic procedures to construct such matrices.
Recommendations
- Extremal inverse eigenvalue problem for symmetric doubly arrow matrices
- Two inverse eigenproblems for symmetric doubly arrow matrices
- An inverse eigenvalue problem for symmetrical tridiagonal matrices
- Two inverse eigenvalue problems for a special kind of matrices
- Extremal inverse eigenvalue problem for a kind of special matrices
Cited in
(10)- Inverse maximal eigenvalues problems for Leslie and doubly Leslie matrices
- Construction of Lefkovitch and doubly Lefkovitch matrices with maximal eigenvalues and some diagonal elements prescribed
- Extreme spectra realization by nonsymmetric tridiagonal and nonsymmetric arrow matrices
- Extremal inverse eigenvalue problem for bordered diagonal matrices
- Two inverse eigenvalue problems for a special kind of matrices
- Extremal inverse eigenvalue problem for symmetric doubly arrow matrices
- scientific article; zbMATH DE number 3959658 (Why is no real title available?)
- Extremal inverse eigenvalue problem for a kind of special matrices
- Inverse eigenproblems of real symmetric doubly arrowhead matrices
- Inverse eigenvalue problems for a class of special matrices
This page was built for publication: Extremal inverse eigenvalue problem for a special kind of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714639)
