Construction of matrices with prescribed singular values and eigenvalues (Q5937102)

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 1618505
Language Label Description Also known as
default for all languages
No label defined
    English
    Construction of matrices with prescribed singular values and eigenvalues
    scientific article; zbMATH DE number 1618505

      Statements

      Construction of matrices with prescribed singular values and eigenvalues (English)
      0 references
      0 references
      0 references
      0 references
      26 June 2002
      0 references
      The necessary and sufficient condition for existence of a complex square matrix with prescribed (nonnegative) singular values and (complex) eigenvalues (viz., the Weyl-Horn inequalities) is generalized to the case where not all the eigenvalues are prescribed (and, by the way, an amusing observation about the ``missing'' eigenvalues is made in this context) and then, the construction itself is addressed. The current available algorithms are made more sophisticated - the order of eigenvalues may be prescribed in triangular case. This idea improves the recent algorithm of \textit{M. T. Chu} [SIAM J. Numer. Anal. 37, No. 3, 1004-1020 (2000; Zbl 0994.65040)] and, as the most important consequence, the matrix may be required real (one first constructs its block-triangular predecessor with the necessary two-by-two partitioning).
      0 references
      eigenvalues and singular values
      0 references
      mutual compatibility (majorization) conditions
      0 references
      re-construction of matrices
      0 references
      re-construction of real matrices
      0 references
      Weyl-Horn inequalities
      0 references
      algorithms
      0 references
      inverse eigenvalue problem
      0 references

      Identifiers