Frame scalings: a condition number approach
From MaRDI portal
Publication:2400252
DOI10.1016/j.laa.2017.02.020zbMath1372.65133arXiv1510.01653OpenAlexW2963075079MaRDI QIDQ2400252
Publication date: 28 August 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.01653
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation of matrix norms, conditioning, scaling (65F35) General harmonic expansions, frames (42C15)
Related Items (6)
Applications of Lax-Milgram theorem to problems in frame theory ⋮ Remarks on scalable frames ⋮ Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling ⋮ Scalable frames in Tensor Product Of Hilbert Spaces ⋮ Frames for the Solution of Operator Equations in Hilbert Spaces with Fixed Dual Pairing ⋮ SCALABILITY OF G-FRAMES BY DIAGONAL OPERATORS
Cites Work
- Constructing all self-adjoint matrices with prescribed spectrum and diagonal
- Probability modelled optimal frames for erasures
- Numerically erasure-robust frames
- Weighted fusion frame construction via spectral tetris
- Constructing tight fusion frames
- Sparse fusion frames: existence and construction
- Spectral tetris fusion frame constructions
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- Tight frames generated by finite nonabelian groups
- Finite normalized tight frames
- Scalable frames
- Necessary and sufficient conditions to perform spectral tetris
- Constructing finite frames of a given spectrum and set of lengths
- On the construction of highly symmetric tight frames and complex polytopes
- Measures of Scalability
- Fingerprinting With Equiangular Tight Frames
- Constructing Finite Frames with a Given Spectrum
- Scaling Laplacian Pyramids
- An introduction to frames and Riesz bases
This page was built for publication: Frame scalings: a condition number approach
