Related papers: Implementation of discretized Gabor frames and the…
Frames for operators or k-frames were recently considered by Gavruta (2012) in connection with atomic systems. Also generalized frames are important frames in the Hilbert space of bounded linear operators. Fusion frames, which are a special…
In the paper Optimal Dual Frames for Probabilistic Erasures, the authors have given conditions under which the canonical dual is claimed to be the unique probability optimal dual for 1-erasure reconstruction. In this paper, we demonstrate…
Controlled frames in Hilbert spaces have been introduced by Balazs, Antoine and Grybos to improve the numerical output of in relation to algorithms for inverting the frame operator. In this paper we have introduced and displayed some new…
Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of…
We construct a canonical frame for an arbitrary Gl(2)-structure thus solving the equivalence problem for Gl(2)-structures. Our treatment includes also a problem of contact equivalence of ordinary differential equations and applies to…
We give a comprehensive introduction to a general modular frame construction in Hilbert C*-modules and to related modular operators on them. The Hilbert space situation appears as a special case. The reported investigations rely on the idea…
In this paper, \( L, M, N, R \) are positive integers, and \( \mathbb{S} \) is an \( N \)-periodic subset of \( \mathbb{Z} \). The space \( \ell^2(\mathbb{S}, \mathbb{C}^R) \) denotes the Hilbert space of vector-valued square-summable…
Massive data analysis calls for distributed algorithms and theories. We design a multi-round distributed algorithm for canonical correlation analysis. We construct principal directions through the convex formulation of canonical correlation…
We identify and characterise the conformal window in gauge theories relevant for beyond the standard model building, e.g. Technicolour, using the criteria of metric confinement and causal analytic couplings, which are known to be consistent…
The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…
In this paper, we consider the algorithms and convergence for a general optimization problem, which has a wide range of applications in image segmentation, topology optimization, flow network formulation, and surface reconstruction. In…
Numerical global optimization methods are often very time consuming and could not be applied for high-dimensional nonconvex/nonsmooth optimization problems. Due to the nonconvexity/nonsmoothness, directly solving the primal problems…
Gaussian processes are a powerful framework for uncertainty-aware function approximation and sequential decision-making. Unfortunately, their classical formulation does not scale gracefully to large amounts of data and modern hardware for…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
Let $I\subseteq \Bbb N$ be a finite or infinite set and let ${(x_n)_{n\in I}}$ be a frame for a separable Hilbert space $\mathcal{H}$. Consider transmission of a signal $h\in\mathcal{H}$ where a finite subset $(\langle h,x_n\rangle)_{n\in…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
We relate duality mappings to the "Babbage equation" F(F(z)) = z, with F a map linking weak- to strong-coupling theories. Under fairly general conditions F may only be a specific conformal transformation of the fractional linear type. This…
We develop a first-order accelerated algorithm for a class of constrained bilinear saddle-point problems with applications to network systems. The algorithm is a modified time-varying primal-dual version of an accelerated mirror-descent…
We consider sparseness properties of adaptive time-frequency representations obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical Gabor frames by allowing for adaptivity in either time or frequency. It is known that…
We demonstrate that it is possible to filter an image with an elliptic window of varying size, elongation and orientation with a fixed computational cost per pixel. Our method involves the application of a suitable global pre-integrator…