Constructing all self-adjoint matrices with prescribed spectrum and diagonal
From MaRDI portal
Publication:380995
DOI10.1007/s10444-013-9298-zzbMath1279.42034arXiv1107.2173OpenAlexW2044762158MaRDI QIDQ380995
Dustin G. Mixon, Matthew Fickus, Miriam J. Poteet, Nate Strawn
Publication date: 15 November 2013
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2173
Related Items (11)
Admissibility and frame homotopy for quaternionic frames ⋮ Polytopes of eigensteps of finite equal norm tight frames ⋮ Frame scalings: a condition number approach ⋮ Binary frames with prescribed dot products and frame operator ⋮ Optimal Parseval frames: total coherence and total volume ⋮ Linearly connected sequences and spectrally optimal dual frames for erasures ⋮ Phase retrieval from very few measurements ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ Determinantal sampling designs ⋮ Unnamed Item ⋮ A generalized Schur-Horn theorem and optimal frame completions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing tight fusion frames
- Finite frame varieties: Nonsingular points, tangent spaces, and explicit local parameterizations
- Auto-tuning unit norm frames
- Diagonal elements and eigenvalues of a real symmetric matrix
- The road to equal-norm Parseval frames
- Geometric proofs of some theorems of Schur-Horn type
- Optimal frames for erasures.
- Numerically stable generation of correlation matrices and their factors
- Equal-norm tight frames with erasures
- Constructing finite frames of a given spectrum and set of lengths
- The Schur-Horn theorem for operators and frames with prescribed norms and frame operator
- Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences
- Matrix Analysis
- Population correlation matrices for sampling experiments
- Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- Optimal sequences and sum capacity of synchronous CDMA systems
- Twice-ramanujan sparsifiers
- Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Quantized frame expansions with erasures
This page was built for publication: Constructing all self-adjoint matrices with prescribed spectrum and diagonal