Constructing matrices with prescribed main-diagonal submatrix and characteristic polynomial (Q855581)

From MaRDI portal





scientific article; zbMATH DE number 5078020
Language Label Description Also known as
default for all languages
No label defined
    English
    Constructing matrices with prescribed main-diagonal submatrix and characteristic polynomial
    scientific article; zbMATH DE number 5078020

      Statements

      Constructing matrices with prescribed main-diagonal submatrix and characteristic polynomial (English)
      0 references
      0 references
      7 December 2006
      0 references
      Let \(\mathbb{F}\) be a field. For a given matrix \(A_{12}\in\mathbb{F}^{p\times p}\) and a monic polynomial of \(\mathbb{F}[x]\) of degree \(p+q\), \textit{G. N. de Oliveira} [Monatsh. Math. 75, 441--446 (1971; Zbl 0239.15006)] provided necessary and sufficient conditions for the existence of matrices \(A_{12}\in\mathbb{F}^{p\times q}\), \(A_{21}\in\mathbb{F}^{q\times p}\), and \(A_{22}\in\mathbb{F}^{q\times q}\) such that \(f\) is the characteristic polynomial of the \(2\times 2\) block matrix \(\left( \begin{matrix} A_{11} & A_{12} \\ A_{21} & A_{22} \\ \end{matrix} \right) . \) In this note, the author simplifies the finite step algorithm proposed by \textit{Kh. D. Ikramov} and \textit{V. N. Chugunov} [J. Math. Sci., New York 98, No. 1, 51--136 (2000; Zbl 0954.65032)] for de Oliveira's theorem.
      0 references
      inverse eigenvalue problem
      0 references
      matrix completion problem
      0 references
      Hessenberg
      0 references
      Hessenberg matrices
      0 references
      finite step algorithm
      0 references

      Identifiers