Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
From MaRDI portal
Publication:5317650
DOI10.1137/S0895479803438183zbMath1087.65038OpenAlexW2047852075WikidataQ59750809 ScholiaQ59750809MaRDI QIDQ5317650
Inderjit S. Dhillon, Robert W. jun. Heath, Mátyás A. Sustik, Joel A. Tropp
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479803438183
numerical examplesHermitian matricesinverse eigenvalue problemmajorizationSchur-Horn theoremplane rotationsfinite-step algorithms
Related Items
Constructing all self-adjoint matrices with prescribed spectrum and diagonal, Optimization over finite frame varieties and structured dictionary design, Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements, Frame completions with prescribed norms: local minimizers and applications, A characterization of minimal Hermitian matrices, Finite frame varieties: Nonsingular points, tangent spaces, and explicit local parameterizations, Auto-tuning unit norm frames, Optimal frame completions with prescribed norms for majorization, Optimal frame completions, Optimal frame designs for multitasking devices with weight restrictions, Non-commutative Schur–Horn theorems and extended majorization for Hermitian matrices, Constructing finite frames of a given spectrum and set of lengths, Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems, Determinantal sampling designs, Unnamed Item, Majorisation and the carpenter's theorem, Optimal \(\alpha,\mathfrak{d})\)-multi-completion of \(\mathfrak{d}\)-designs, Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections, A generalized Schur-Horn theorem and optimal frame completions
