Generalized finite algorithms for constructing Hermitian matrices with prescribed diagonal and spectrum

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 1, 2006, Pages 61-71

  Dhillon, Inderjit S ^a   Heath Jr , Robert W ^b   Sustik, Mátyás A ^a   Tropp, Joel A ^c  

^a University of Texas at Austin   (United States)

^b The University of Texas at Austin   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Finite step algorithms; Hermitian matrices; Inverse eigenvalue problem; Majorization; Plane rotations; Schur Horn theorem

Indexed keywords

FINITE-STEP ALGORITHMS; HERMITIAN MATRICES; INVERSE EIGENVALUE PROBLEM; MAJORIZATION; PLANE ROTATIONS; SCHUR-HORN THEOREM;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

MATRIX ALGEBRA;

EID: 33144482555     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479803438183     Document Type: Article

References (23)

1. B. C. ARNOLD, Majorization and the Lorenz Order: A Brief Introduction, Lecture Notes in Statistics, 43, Springer-Verlag, Berlin, 1987.
2. R. B. BENDEL AND M. R. MICKEY, Population correlation matrices for sampling experiments, Commun. Statist. Simul. Comp., B7 (1978), pp. 163-182.
3. R. BHATIA, Matrix Analysis, Springer-Verlag, New York, 1996.
4. N. N. CHAN AND K.-H. LI, Diagonal elements and eigenvalues of a real symmetric matrix, J. Math. Anal. Appl., 91 (1983), pp. 562-566.
5. M. T. CHU, Constructing a Hermitian matrix from its diagonal entries and eigenvalues, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 207-217.
6. P. I. DAVIES AND N. J. HIGHAM, Numerically stable generation of correlation matrices and their factors, BIT, 40 (2000), pp. 640-651.
7. I. S. DHILLON, R. W. HEATH JR., M. A. SUSTIK, AND J. A. TROPP, Generalized finite algorithms for constructing Hermitian matrices with prescribed diagonal and spectrum, Technical Report TR-03-49, Department of Computer Sciences, The University of Texas at Austin, Austin, TX, 2003.
8. I. S. DHILLON AND A. N. MALYSHEV, Inner deflation for symmetric tridiagonal matrices, Linear Algebra Appl., 358 (2003), pp. 139-144.
9. Z. DRMAČ, Accurate computation of the product-induced singular value decomposition with applications, SIAM J. Numer. Anal., 35 (1998), pp. 1969-1994.
10. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
11. R. B. HOLMES, On random correlation matrices, SIAM J. Matrix Anal. Ap., 12 (1991), pp. 239-272.
12. A. HORN, Doubly stochastic matrices and the diagonal of a rotation matrix, Amer. J. Math., 76 (1954), pp. 620-630.
13. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
14. K. D. IKRAMOV, A remark on "A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues," BIT, 38 (1998), p. 807.
15. J. L. KELLEY, General Topology, Van Nostrand, New York, 1955.
16. R. S. LEITE, R. W. RICHA, AND C. TOMEI, Geometric proofs of some theorems of Schur-Horn type, Linear Algebra Appl., 286 (1999), pp. 149-173.
17. G. MARSAGLIA AND I. OLKIN, Generating correlation matrices, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 470-475.
18. A. W. MARSHALL AND I. OLKIN, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
19. G. W. STEWART, The efficient generation of random orthogonal matrices with an application to condition estimation, SIAM J. Numer. Anal., 17 (1980), pp. 403-409.
20. J. A. TROPP, I. S. DHILLON, AND R. W. HEATH JR., Finite-step algorithms for constructing optimal CMDA signature sequences, IEEE Trans. Inform. Theory, 50 (2004), pp. 2916-2921.
21. J. A. TROPP, I. S. DHILLON, R. W. HEATH JR., AND T. STROHMER, Designing structured tight frames via an alternating projection method, IEEE Trans. Inform. Theory, 51 (2004), pp. 188-209.
22. P. VISWANATH AND V. ANANTHARAM, Optimal sequences and sum capacity of synchronous CDMA systems, IEEE Trans. Inform. Theory, 45 (1999), pp. 1984-1991.
23. H. ZHA AND Z. ZHANG, A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues, BIT, 35 (1995), pp. 448-451.