Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFourier transform of Rauzy fractals and point spectrum of 1D Pisot inflation tilings
101
0
0.0
(
0
)
Authors
Michael Baake
Ask ChatGPT about the research
No Arabic abstract
Primitive inflation tilings of the real line with finitely many tiles of natural length and a Pisot--Vijayaraghavan unit as inflation factor are considered. We present an approach to the pure point part of their diffraction spectrum on the basis of a Fourier matrix cocycle in internal space. This cocycle leads to a transfer matrix equation and thus to a closed expression of matrix Riesz product type for the Fourier transforms of the windows for the covering model sets. In general, these windows are complicated Rauzy fractals and thus difficult to handle. Equivalently, this approach permits a construction of the (always continuously representable) eigenfunctions for the translation dynamical system induced by the inflation rule. We review and further develop the underlying theory, and illustrate it with the family of Pisa substitutions, with special emphasis on the Tribonacci case.
rate research
Read More
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by corresponding weights. The calculation is valid for the function under the transform being piecewise smooth in the continuum variable. The scheme reduces significantly the requirement for computer memory storage and enhances the numerical computation efficiency without losing accuracy. By comparing with the known results of examples, we show the accuracy and the efficiency of the scheme. The efficiency can be higher than $10^6$ for the examples.
The one dimensional wave equation serves as a basic model for imaging modalities such as seismic which utilize acoustic data reflected back from a layered medium. In 1955 Peterson et al. described a single scattering approximation for the one dimensional wave equation that relates the reflection Greens function to acoustic impedance. The approximation is simple, fast to compute and has become a standard part of seismic theory. The present paper re-examines this classical approximation in light of new results concerning the (exact) measurement operator for reflection imaging of layered media, and shows that the classical approximation can be substantially improved. We derive an alternate formula, called the refined impedance transform, that retains the simplicity and speed of computation of the classical estimate, but which is qualitatively more accurate and applicable to a wider range of recorded data. The refined impedance transform can be applied to recorded data directly (without the need to deconvolve the source wavelet), and solves exactly the inverse problem of determining the value of acoustic impedance on the far side of an arbitrary slab of unknown structure. The results are illustrated with numerical examples.
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $R^n$, that generalizes the $n$-th fold DFT of the integer lattice $Z^n$ to arbitrary lattices. This definition is not applicable for every lattice, but can be defined on lattices known as Systematic Normal Form (SysNF) introduced in cite{ES16}. Systematic Normal Form lattices are sets of integer vectors that satisfy a single homogeneous modular equation, which itself satisfies a certain number-theoretic property. Such lattices form a dense set in the space of $n$-dimensional lattices, and can be used to approximate efficiently any lattice. This implies that for every lattice $L$ a DFT can be computed efficiently on a lattice near $L$. Our proof of the statement above uses arguments from quantum computing, and as an application of our definition we show a quantum algorithm for sampling from discrete distributions on lattices, that extends our ability to sample efficiently from the discrete Gaussian distribution cite{GPV08} to any distribution that is sufficiently smooth. We conjecture that studying the eigenvectors of the newly-defined lattice DFT may provide new insights into the structure of lattices, especially regarding hard computational problems, like the shortest vector problem.
Local iterated function systems are an important generalisation of the standard (global) iterated function systems (IFSs). For a particular class of mappings, their fixed points are the graphs of local fractal functions and these functions themselves are known to be the fixed points of an associated Read-Bajactarevic operator. This paper establishes existence and properties of local fractal functions and discusses how they are computed. In particular, it is shown that piecewise polynomials are a special case of local fractal functions. Finally, we develop a method to compute the components of a local IFS from data or (partial differential) equations.
Fourier-transformable Radon measures are called doubly sparse when both the measure and its transform are pure point measures with sparse support. Their structure is reasonably well understood in Euclidean space, based on the use of tempered distributions. Here, we extend the theory to second countable, locally compact Abelian groups, where we can employ general cut and project schemes and the structure of weighted model combs, along with the theory of almost periodic measures. In particular, for measures with Meyer set support, we characterise sparseness of the Fourier--Bohr spectrum via conditions of crystallographic type, and derive representations of the measures in terms of trigonometric polynomials. More generally, we analyse positive definite, doubly sparse measures in a natural cut and project setting, which results in a Poisson summation type formula.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
