相关论文: Kaczmarz algorithm in Hilbert space and tight fram…
This paper considers different facets of the interplay between reproducing kernel Hilbert spaces (RKHS) and stable analysis/synthesis processes: First, we analyze the structure of the reproducing kernel of a RKHS using frames and…
The Kaczmarz method for solving linear systems of equations is an iterative algorithm that has found many applications ranging from computer tomography to digital signal processing. Despite the popularity of this method, useful theoretical…
Let $H$ be an infinite-dimensional separable Hilbert space and let $(X,d,\mu)$ be a metric measure space satisfying the doubling and upper Alhfors regularity conditions at small scale. We prove that every bounded continuous tight frame…
An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate…
Motivated by recent work in Dynamical Sampling, we prove a necessary and sufficient condition for a frame in a separable and infinite-dimensional Hilbert space to admit the form $\{T^{n} \varphi \}_{n \geq 0}$ with $T \in B(H)$. Also, a…
Frame theory is recently an active research area in mathematics, computer science and engineering with many exciting applications in a variety of different fields. This theory has been generalized rapidly and various generalizations of…
In this paper, we introduce a new concept of K-biframes for Hilbert spaces. We then examine several characterizations with the assistance of a biframe operator. Moreover, we investigate their properties from the perspective of operator…
In this paper we deal with the connection of frames with the class of Hilbert Schmidt operators. First we give an easy criteria for operators being in this class using frames. It is the equivalent to the criteria using orthonormal bases.…
The Hildreth's algorithm is a row action method for solving large systems of inequalities. This algorithm is efficient for problems with sparse matrices, as opposed to direct methods such as Gaussian elimination or QR-factorization. We…
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…
Coherent continuous wave (CW) terahertz spectroscopy is an extremely valuable technique that allows for the interrogation of systems that exhibit narrow resonances in the terahertz (THz) frequency range, such as high-quality (high-Q) THz…
An algorithmic framework to compute sparse or minimal-TV solutions of linear systems is proposed. The framework includes both the Kaczmarz method and the linearized Bregman method as special cases and also several new methods such as a…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
In this paper we develop a method for studying tight contact structures on lens spaces. We then derive uniqueness and non-existence statements for tight contact structures with certain (half) Euler classes on lens spaces. We also prove that…
Kaczmarz's alternating projection method has been widely used for solving a consistent (mostly over-determined) linear system of equations Ax=b. Because of its simple iterative nature with light computation, this method was successfully…
We study strongly measurable random bounded operators on separable Hilbert spaces and analyze two simple iterations driven by independent random positive contractions. The first, a Kaczmarz-like iteration, converges in mean square and…
A frame is a system of vectors $S$ in Hilbert space $\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\mathscr{H}$; expressed in…
In this paper we make a theoretical analysis of the convergence rates of Kaczmarz and Extended Kaczmarz projection algorithms for some of the most practically used control sequences. We first prove an at least linear convergence rate for…
In this paper we discuss some topics related to the general theory of frames. In particular we focus our attention to the existence of different 'reconstruction formulas' for a given vector of a certain Hilbert space and to some refinement…
The need for a mathematically rigorous quantization procedure of singular spaces and incomplete motions is pointed out in connection with quantum cosmology. We put our previous suggestion for such a procedure, based on the theory of induced…