On problems of bordering and modifying Hermitian matrices
The augmentation (bordering) and modification problems for the Hermitian \((n \times n)\)-matrices \(A\) are studied. The augmentation problem of order \(r\) for the matrix \(A\) is defined as the process of the construction of a Hermitian \(((n+r) \times (n+r))\)-matrix \(B\) with prescribed eigenvalues so that \((B)_{ij}=(A)_{ij}\) for \(1 \leq i,j \leq n\). The modification problem of rank \(r\) consists in the construction of a Hermitian \((n \times n)\)-matrix \(B\) of rank not greater than \(r\) so that the matrix \((A+B)\) has a given spectrum. Necessary and sufficient conditions are obtained for the existence of a solution for both augmentation and modification problems for an arbitrary integer \(r\). Also, the minimal number of different eigenvalues in the prescribed spectra of the solution of both problems is estimated.
- The bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitian eigenvalue problem
- scientific article; zbMATH DE number 37930
- The bounds of the eigenvalues for rank-one modification of Hermitian matrix.
- On solvability of inverse eigenvalue problems with Hermitian matrices
- Some sufficient conditions for the solvability of inverse eigenvalue problems
This page was built for publication: On problems of bordering and modifying Hermitian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810053)
