Clare Wickman Lau, Kasso A. Okoudjou
Published 2015-01-29Version 1
We consider the problem of rescaling the lengths of a finite frame thereby transforming it into a tight one. Such frames are called scalable and have received a lot of attention in recent years. In this note we investigate the question in terms of probabilistic frames and give conditions under which a (discrete) probabilistic frame is scalable.
Cubic equations with 2 Roots in the interval $[-1, 1]$
Curvature of planar aesthetic curves
Analysis and approximation of mixed-dimensional PDEs on 3D-1D domains coupled with Lagrange multipliers
![QR code for arXiv:1501.07321 [math.NA]](http://oss.arxitics.com/images/favicon.svg)