A wavelet-packet census algorithm for calculating vortex statistics

doi:10.1063/1.869318

Return

A wavelet-packet census algorithm for calculating vortex statistics

1997-07-01

PRE

Andrew Siegel *

Jeffrey B. Weiss

DOI：10.1063/1.869318

Original

Original request for help

Save

Abstract

En 中文

A generalized wavelet-packet based technique for decomposing signals into coherent and noncoherent parts is presented. The method is tested on the vorticity held of numerical simulations of weakly decaying two-dimensional turbulence. The easily recognizable coherent vortex structures that emerge are systematically filtered from the solution. Once extracted, various properties of the vortices, such as their number, size, circulation, and peak value are computed. The results compare well with a similar study [J. Fluid Mech. 219, 361 (1990); Phys. Fluids 5, 608 (1993)]. which employs a complex pattern recognition technique based exclusively on a priori knowledge of the properties of the solution-that is, the features typical of the resulting vortex structures. The similarity of the results is encouraging, suggesting that the wavelet packet technique, by absorbing much of the complexity into the mathematical features of the transform itself, can provide an efficient, standardized tool that is readily extendible to more complex problems in two and three dimensions. (C) 1997 American Institute of Physics.

Keywords:

2-DIMENSIONAL TURBULENCE

COHERENT STRUCTURES

VORTICES

ENERGY

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.