Procrustes problem for the inverse eigenvalue problem of normal (skew) <i>J</i> -Hamiltonian matrices and normal <i>J</i> -symplectic matrices (Q6939438)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8083572
Language Label Description Also known as
default for all languages
No label defined
    English
    Procrustes problem for the inverse eigenvalue problem of normal (skew) <i>J</i> -Hamiltonian matrices and normal <i>J</i> -symplectic matrices
    scientific article; zbMATH DE number 8083572

      Statements

      Procrustes problem for the inverse eigenvalue problem of normal (skew) <i>J</i> -Hamiltonian matrices and normal <i>J</i> -symplectic matrices (English)
      0 references
      0 references
      0 references
      0 references
      21 August 2025
      0 references
      For a given full-column rank matrix \(X\in\mathbb C^{n\times m}\) and a diagonal \(D\in\mathbb C^{m\times m}\), let \(\mathcal S\) denote the set of all solutions \(A\in\mathbb C^{n\times n}\) to the inverse eigenvalue problem \(AX=XD\).\N\NThe paper is devoted to several versions of the \textit{Procrustes problem}, namely, minimizing the Frobenius norm of \(\widetilde{A}-A\) when \(\widetilde{A}\in\mathbb C^{n\times n}\) is given and \(A\in \mathcal S\cap\mathcal T\). Here \(\mathcal T\) is one of the following three classes: normal \(J\)-Hamiltonian, normal skew \(J\)-Hamiltonian, and normal \(J\)-symplectic matrices. In each case, the uniqueness and existence criteria, the construction algorithm, and numerical examples are provided.
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references