Preconditioning techniques in frame theory and probabilistic frames

MaRDI QIDQ5507110zbMATH OpenFDO

Authors Kasso A. Okoudjou

Publication date 16 December 2016

Full work available at URL https://arxiv.org/abs/1504.02023

zbMATH Keywords

\(p^{\mathrm{th}}\) frame potentialscontinuous framesconvex polytopesfinite framesframe potentialFritz John's ellipsoid theoremprobabilistic frame potentialsprobabilistic framesscalable framestight frames

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) (n)-dimensional polytopes (52B11)

Abstract: In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in such a way that the resulting frames are tight. This process can be thought of as a preconditioning method for finite frames. In particular, we: (1) describe the class of scalable frames; (2) formulate various equivalent characterizations of scalable frames, and relate the scalability problem to the Fritz John ellipsoid theorem. Next, we discuss some results on a probabilistic interpretation of frames. In this setting, we: (4) define probabilistic frames as a generalization of frames and as a subclass of continuous frames; (5) review the properties of certain potential functions whose minimizers are frames with certain optimality properties. The chapter is based on a lecture given by the author at the AMS 2015 Short Course on Finite Frame Theory: A Complete Introduction to Overcompleteness.

Recommendations

• Scalable frames
• Scalable frames and convex geometry
• Frame scalings: a condition number approach
• SCALABILITY OF G-FRAMES BY DIAGONAL OPERATORS
• scientific article; zbMATH DE number 7112232

Cited in

(10)

• Scalable frames
• Frame multiplication theory and a vector-valued DFT and ambiguity function
• Preconditioning filter bank decomposition using structured normalized tight frames
• Scalable frames and convex geometry
• Optimization methods for frame conditioning and application to graph Laplacian scaling
• Scalable frames in Tensor Product Of Hilbert Spaces
• Decomposition of Gaussian processes, and factorization of positive definite kernels
• SCALABILITY OF G-FRAMES BY DIAGONAL OPERATORS
• A generalization of Gleason's frame function for quantum measurement
• A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces

This page was built for publication: Preconditioning techniques in frame theory and probabilistic frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507110)