Related papers: Analysis of Framelet Transforms on a Simplex
This paper presents a discussion on $p$-adic multiframe by means of its wavelet structure, called as multiframelet, which is build upon $p$-adic wavelet construction. Multiframelets create much excitement in mathematicians as well as…
Using projections on the (generalized) eigenvectors associated to matrices that characterize the topological structure, several authors have constructed generalizations of the Fourier transform on graphs. By exploring mappings of the…
In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…
An important open problem in geometric complex analysis is to find algorithms for explicit determination of basic functionals intrinsically connected with conformal and quasiconformal maps, such as their Teichmuller and Grunsky norms,…
Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
We introduce a fast Fourier transform on regular d-dimensional lattices. We investigate properties of congruence class representants, i.e. their ordering, to classify directions and derive a Cooley-Tukey-Algorithm. Despite the fast Fourier…
We extend the TFT construction of CFT correlators of [arXiv:hep-th/0204148] to so-called finite logarithmic CFTs for which the algebraic input data is no longer semisimple but still finite. More specifically, starting from the data of a…
In this article, we develop a general method for constructing wavelets {|det A_j|^{1/2} g(A_jx-x_{j,k}): j in J, k in K}, on irregular lattices of the form X={x_{j,k} in R^d: j in J, k in K}, and with an arbitrary countable family of…
The paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…
Construction of multivariate tight framelets is known to be a challenging problem. Multivariate dual framelets with vanishing moments generalize tight framelets and are not easy to be constructed either. Compactly supported multivariate…
In 1984, the second author conjectured a quadratic transformation formula which relates two hypergeometric 2F1 functions over a finite field F_q. We prove this conjecture and give an application. The proof depends on a new linear…
We study the Hankel transforms of sequences related to the central coefficients of a family of Pascal-like triangles. The mechanism of Riordan arrays is used to elucidate the structure of these transforms.
We propose a novel method for constructing Hilbert transform (HT) pairs of wavelet bases based on a fundamental approximation-theoretic characterization of scaling functions--the B-spline factorization theorem. In particular, starting from…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
We will introduce formal frames of manifolds, which are a generalization of ordinary frames. Their fundamental properties are discussed. In particular, canonical forms are introduced, and torsions are defined in terms of them as a…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…
The usual fluid equations describing the large-scale evolution of mass density in the universe can be written as local in the density, velocity divergence, and velocity potential fields. As a result, the perturbative expansion in small…
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely…