Skip to main content
Log in

Construction of Matrices with Prescribed Singular Values and Eigenvalues

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Two issues concerning the construction of square matrices with prescribe singular values an eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values an m (≤ n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating the case when m = n. Second, an algorithm is given to generate a triangular matrix with prescribe singular values an eigenvalues. Unlike earlier algorithms, the eigenvalues can be arranged in any prescribe order on the diagonal. A slight modification of this algorithm allows one to construct a real matrix with specified real an complex conjugate eigenvalues an specified singular values. The construction is done by multiplication by diagonal unitary matrices, permutation matrices and rotation matrices. It is numerically stable and may be useful in developing test software for numerical linear algebra packages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. N. Bebiano, C.-K. Li, and J. da Providencia, Product of diagonal elements of matrices, Linear Algebra Appl., 178 (1993), pp. 185–200.

    Google Scholar 

  2. R. Bhatia, Matrix Analysis, Springer-Verlag, New York, 1997.

    Google Scholar 

  3. Z. Bai and J. Demmel, On swapping diagonal blocks in the real Schur form, Linear Algebra Appl. 186 (1993), pp. 73–96.

    Google Scholar 

  4. M. T. Chu, A fast recursive algorithm for constructing matrices with prescribed eigenvalues and singular values, SIAM J. Numer. Anal., 37:3 (2000), pp. 1004–1010.

    Google Scholar 

  5. A. Horn, On the eigenvalues of a matrix with prescribed singular values, Proc. Amer. Math. Soc., 5 (1954), pp. 4–7.

    Google Scholar 

  6. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.

    Google Scholar 

  7. P. Kosowski and A. Smoktunowicz, Computing a unit triangular matrix with prescribed singular values, Preprint Nr. 70, Politechnika Warszawska, Instytut Matematyki, Dec. 1997.

  8. P. Kosowski and A. Smoktunowicz, Constructing unit triangular matrices with prescribed singular values, Computing 64 (2000), pp. 279–285.

    Google Scholar 

  9. A. W. Marshall and I. Olkin, Inequalities: The Theory of Majorization and its Applications, Academic Press, New York, 1979.

    Google Scholar 

  10. T. Y. Tam, Partial superdiagonal elements and singular values of a complex skewsymmetric matrix, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 737–754.

    Google Scholar 

  11. H. Weyl, Inequalities between two kinds of eigenvalues of a linear transformation, Proc. Nat. Acad. Sci. USA, 35 (1949), pp. 408–411.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, CK., Mathias, R. Construction of Matrices with Prescribed Singular Values and Eigenvalues. BIT Numerical Mathematics 41, 115–126 (2001). https://doi.org/10.1023/A:1021969818438

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021969818438

Navigation