Skip to main content
Log in

A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A finite step algorithm is given such that for any two vectorsa, λ ∈R n witha majorized by λ, it computes a symmetric matrixHR n x n with the elements ofa and λ as its diagonal entries and eigenvalues, respectively.

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. M. Chu.Constructing a Hermitian matrix from its diagonal entries and eigenvalues, SIAM Journal on Matrix Analysis and Applications, 16(1995), pp. 207–217.

    Google Scholar 

  2. G. H. Golub and C. F. Van Loan.Matrix Computations. Johns Hopkins University Press, Baltimore, Maryland, 2nd edition, 1989.

    Google Scholar 

  3. A. W. Marshall and I. Olkin.Inequalities: Theory of Majorization and Its Applications. Academic Press, New York, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by NSF grant CCR-9308399.

Supported in part by China State Major Key Project for Basic Researches.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zha, H., Zhang, Z. A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues. Bit Numer Math 35, 448–452 (1995). https://doi.org/10.1007/BF01732616

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01732616

Keywords

Navigation