Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues

DOI10.1137/S0895479893243177zbMath0815.65052MaRDI QIDQ4325687

Moody T. Chu

Publication date: 14 June 1995

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsglobal convergenceeigenvaluesiterative methodinverse eigenvalue problemHermitian matrixmajorizationprojected gradient methodSchur-Horn theoremWielandt-Hoffmann theoremlift and projection method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (13)

Exploring isospectral spring–mass systems with firefly algorithm ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues ⋮ Constructing all self-adjoint matrices with prescribed spectrum and diagonal ⋮ Gradient flow methods for matrix completion with prescribed eigenvalues. ⋮ Gradient flows and double bracket equations. ⋮ INVERSE EIGENVALUE PROBLEM FOR EUCLIDEAN DISTANCE MATRICES OF SIZE 3 ⋮ Constructing finite frames of a given spectrum and set of lengths ⋮ A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem ⋮ Minimum symbol error probability MIMO design under the per-antenna power constraint ⋮ A remark on ``A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues ⋮ On constructing matrices with prescribed singular values and diagonal elements ⋮ A generalized Schur-Horn theorem and optimal frame completions

This page was built for publication: Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues