Scalable frames and convex geometry
From MaRDI portal
Abstract: The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight frame. In this paper we define -scalability, a refinement of scalability based on the number of non-zero weights used in the rescaling process, and study the connection between this notion and elements from convex geometry. Finally, we provide results on the topology of scalable frames. In particular, we prove that the set of scalable frames with "small" redundancy is nowhere dense in the set of frames.
Recommendations
Cited in
(19)- Scalable frames
- Scalable spaces
- Frame scalings: a condition number approach
- On structural decompositions of finite frames
- Minimal scalings and structural properties of scalable frames
- Optimization methods for frame conditioning and application to graph Laplacian scaling
- Scalable frames in Tensor Product Of Hilbert Spaces
- scientific article; zbMATH DE number 7112232 (Why is no real title available?)
- Scaling Laplacian pyramids
- Preconditioning techniques in frame theory and probabilistic frames
- SCALABILITY OF G-FRAMES BY DIAGONAL OPERATORS
- On root frames in \(\mathbb{R}^d\)
- Applications of Lax-Milgram theorem to problems in frame theory
- Representations of frames via iterative actions of operators in tensor product spaces
- Remarks on scalable frames
- Characterization of dual scalable frames
- Piecewise scalable frames in Hilbert spaces
- Exact discretization, tight frames and recovery via D-optimal designs
- Frame scaling by graphs
This page was built for publication: Scalable frames and convex geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939706)