Related papers: Scalable Frames and Convex Geometry
With the increase in computational power for the available hardware, the demand for high-resolution data in computer graphics applications increases. Consequently, classical geometry processing techniques based on linear algebra solutions…
In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
Jammed packings' mechanical properties depend sensitively on their detailed local structure. Here we provide a complete characterization of the pair correlation close to contact and of the force distribution of jammed frictionless spheres.…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
Amenability is a geometric property of convex cones that is stronger than facial exposedness and assists in the study of error bounds for conic feasibility problems. In this paper we establish numerous properties of amenable cones, and…
We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…
This paper introduces a new shape-based image reconstruction technique applicable to a large class of imaging problems formulated in a variational sense. Given a collection of shape priors (a shape dictionary), we define our problem as…
Materials exhibit geometric structures across mesoscopic to microscopic scales, influencing macroscale properties such as appearance, mechanical strength, and thermal behavior. Capturing and modeling these multiscale structures is…
Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with…
This work developes a quantitative framework for describing the overcompleteness of a large class of frames. A previous paper introduced notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and…
Frames for Hilbert spaces are interesting for mathematicians but also important for applications e.g. in signal analysis and in physics. Both in mathematics and physics it is natural to consider a full scale of spaces, and not only a single…
A new geometrically exact micro-structured model is constructed using a generalisation of the notion of Riemann-Cartan manifolds and fibre bundle theory of rank 3. This model is based around the concept of two different length scales: a…
A new line of research on the lasso exploits the beautiful geometric fact that the lasso fit is the residual from projecting the response vector $y$ onto a certain convex polytope. This geometric picture also allows an exact geometric…
We construct a Parseval frame with $n+1$ vectors in $\R^n$ that contains a given vector. We also provide a characterization of unit-norm frames that can be scaled to a Parseval frame.
Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…
Many quantities we are interested in predicting are geometric tensors; we refer to this class of problems as geometric prediction. Attempts to perform geometric prediction in real-world scenarios have been limited to approximating them…
Multiple scales coexist in complex networks. However, the small world property makes them strongly entangled. This turns the elucidation of length scales and symmetries a defiant challenge. Here, we define a geometric renormalization group…
Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic…