Computing Lagrangian means
نویسندگان
چکیده
Lagrangian averaging plays an important role in the analysis of wave–mean-flow interactions and other multiscale fluid phenomena. The numerical computation means, e.g. from simulation data, is, however, challenging. Typical implementations require tracking a large number particles to construct time series, which are then averaged using low-pass filter. This has drawbacks that include memory demands, particle clustering complications parallelisation. We develop novel approach means various fields (including positions) computed by solving partial differential equations (PDEs) integrated over successive intervals. propose two strategies, distinguished their spatial independent variables. first, generalises algorithm Kafiabad ( J. Fluid Mech. , vol. 940, 2022, A2), uses end-of-interval positions; second directly mean positions. PDEs can be discretised variety ways, same discretisation as employed for governing dynamical equations, solved on-the-fly minimise footprint. illustrate new with pseudo-spectral implementation rotating shallow-water model. Two applications flows combine vortical turbulence Poincaré waves demonstrate superiority Eulerian wave–vortex separation.
منابع مشابه
Rna Structural Alignment by Means of Lagrangian Relaxation
This thesis deals with an important topic in computational molecular biology: structurally correct alignments of RNA sequences. Compared to DNA sequences where sequence information is normally sufficient for adequate alignments, the structural aspects of RNA have to be taken into account when dealing with RNA sequences: structure of RNA sequences tends to remain conserved throughout evolution. ...
متن کاملSome Aspects on Computing Means Development Philosophy
Some factors influencing computer facilities and programming development appear in this paper. The negative role of present tendencies and development influence is noted.
متن کاملComputing Medians and Means in Hadamard Spaces
The geometric median as well as the Fréchet mean of points in a Hadamard space are important in both theory and applications. Surprisingly, no algorithms for their computation are hitherto known. To address this issue, we use a splitting version of the proximal point algorithm for minimizing a sum of convex functions and prove that this algorithm produces a sequence converging to a minimizer of...
متن کاملAutonomic Computing - A Means of Achieving Dependability?
Autonomic Computing is emerging as a significant new approach to the design of computing systems. Its goal is the development of systems that are selfconfiguring, self-healing, self-protecting and selfoptimizing. Dependability is a long-standing desirable property of all computer-based systems. The purpose of this paper is to consider how Autonomic Computing can provide a framework for dependab...
متن کاملOn Play by Means of Computing Machines
This paper examines the "bounded rationality" inherent in play by means of computing machines. The main example is the finitely repcated prisoners' dilemma game which is discussed under different models. The game is played by Turing machines with restricted number of internal states using unlimited time and space. The observations in this paper strongly suggest that the cooperative outcome of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fluid Mechanics
سال: 2023
ISSN: ['0022-1120', '1469-7645']
DOI: https://doi.org/10.1017/jfm.2023.228