Related Experiment Video
Updated: May 24, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Turbulence in noninteger dimensions by fractal Fourier decimation
Uriel Frisch1, Anna Pomyalov, Itamar Procaccia
1UNS, CNRS, OCA, Laboratoire Lagrange, Nice, France.
Physical Review Letters
|March 10, 2012
Summary
Fractal decimation in fluid dynamics reveals that turbulence persists at lower effective dimensions. The inverse cascade continues below D=2, with the Kolmogorov constant increasing significantly as the dimension approaches the critical value.
Area of Science:
- Fluid Dynamics
- Statistical Mechanics
- Turbulence Theory
Background:
- Fractal decimation is a technique used to reduce the effective dimensionality of a fluid flow by selectively retaining Fourier modes.
- An equilibrium Gibbs state with a k(-5/3) spectrum is known to exist at the critical dimension D(c)=4/3, consistent with prior research.
- Understanding the behavior of turbulence at reduced dimensions is crucial for developing comprehensive fluid dynamics models.
Purpose of the Study:
- To investigate the persistence and characteristics of the inverse cascade in fractally decimated two-dimensional turbulence.
- To analyze the behavior of the Kolmogorov constant as the effective dimensionality is reduced below D=2.
- To explore the relationship between fractal decimation and established turbulence spectra.
Main Methods:
- Spectral simulations were employed to model fractally decimated two-dimensional turbulence.
- The study focused on analyzing the Fourier mode distribution, where the number of modes in a ball of radius k is proportional to k(D).
- The behavior of the inverse cascade and the Kolmogorov constant were examined across different effective dimensions D.
Main Results:
- The inverse cascade was observed to persist even when the effective dimensionality D was reduced below 2.
- A rapidly increasing Kolmogorov constant was detected as D approached the critical dimension of 4/3.
- The Kolmogorov constant is predicted to diverge as (D-4/3)(-2/3) near the critical dimension.
Conclusions:
- Fractal decimation allows for the study of turbulence at effective dimensions lower than the physical dimension.
- The findings suggest that the inverse cascade is a robust feature of turbulence, persisting under dimensional reduction.
- The divergence of the Kolmogorov constant near D(c)=4/3 highlights a critical transition in turbulent behavior.
Related Concept Videos
Downsampling
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
Properties of Fourier series II
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
A function f(t) is...
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...

