Related papers: Minimal scalings and structural properties of scal…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
In this paper we define "piecewise scalable frames". This new scaling process allows us to alter many frames to Parseval frames which is impossible by the previous standard scaling. We give necessary and sufficient conditions for a frame to…
A (unit norm) frame is scalable if its vectors can be rescaled so as to result into a tight frame. Tight frames can be considered optimally conditioned because the condition number of their frame operators is unity. In this paper we…
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…
Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three…
A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be…
Tight frames can be characterized as those frames which possess optimal numerical stability properties. In this paper, we consider the question of modifying a general frame to generate a tight frame by rescaling its frame vectors; a process…
Scaling frame vectors is a simple and noninvasive way to construct tight frames. However, not all frames can be modifed to tight frames in this fashion, so in this case we explore the problem of finding the best conditioned frame by…
Assume that f is a strict convex function with a unique minimum in R^n. We divide the vector of n-variables to d groups of vector subvariables with d at least two. We assume that we can find the partial minimum of f with respect to each…
Local scaling of a set means that in a neighborhood of a point the structure of the set can be mapped into a finer scale structure of the set. These scaling transformations are compact sets of locally affine (that is: with uniformly…
Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low…
A Parseval frame is a spanning set for a Hilbert space which satisfies the Parseval identity: a vector can be expressed as a linear combination of the frame whose coefficients are inner products with the frame vectors. There is considerable…
This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…
Scalar curvature constraints can be studied by means of splitting procedures. The success of this strategy depends on the control we can get on its splitting factors. We introduce canonical so-called minimal splitting factors. They have…
A frame is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some…
In this paper, we investigate the scalability of a given frame in $\mathbb{R}^n$ by using graphs. For each frame $\phi$ in $\mathbb{R}^n$, we associate a simple undirected graph $G(\phi)$ and use it to verify the scalability of $\phi$. We…
A Hilbert space frame on $R^n$ is {\it scalable} if we can scale the vectors to make them a tight frame. There are known classifications of scalable frames. There are two basic questions here which have never been answered in any $R^n$:…
This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…
The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to display a figure or the tool size needed to mill the figure.…
A fractal surface is a set which is a graph of a bivariate continuous function. In the construction of fractal surfaces using IFS, vertical scaling factors in IFS are important one which characterizes a fractal feature of surfaces…