An Efficient Discretization of the Navier–Stokes Equations in an Axisymmetric Domain. Part 1: The Discrete Problem and its Numerical Analysis

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Probabilistic methods for neural combinatorial optimization

Nikolaos Karalias

The monumental progress in the development of machine learning models has led to a plethora of applications with transformative effects in engineering and science. This has also turned the attention of the research community towards the pursuit of construc ...

EPFL2023

An adaptive space-time algorithm for the incompressible Navier-Stokes equations

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm is presented to solve the incompressible Navier-Stokes equations. Time discretization is performed with the BDF2 method while continuous, piecewise linear anisotropic finite elements are used for the space discretization. Th ...

Academic Press Inc Elsevier Science2023

Distributionally Robust Linear Quadratic Control

Daniel Kuhn, Cagil Kocyigit, Bahar Taskesen

Linear-Quadratic-Gaussian (LQG) control is a fundamental control paradigm that is studied in various fields such as engineering, computer science, economics, and neuroscience. It involves controlling a system with linear dynamics and imperfect observations ...

2023

Anomalous Dissipation and Lack of Selection in the Obukhov-Corrsin Theory of Scalar Turbulence

Maria Colombo, Massimo Sorella

The Obukhov-Corrsin theory of scalar turbulence [21, 54] advances quantitative predictions on passive-scalar advection in a turbulent regime and can be regarded as the analogue for passive scalars of Kolmogorov's K41 theory of fully developed turbulence [4 ...

Springernature2023

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Martin Vetterli, Paul Hurley, Sepand Kashani, Matthieu Martin Jean-André Simeoni, Eric Bezzam

Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a more natural choi ...

SIAM2022

Fourier uniqueness and interpolation in Euclidean space

Martin Peter Stoller

We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radii are square roots of integers. In particular, the only ...

EPFL2022

midiVERTO: A Web Application to Visualize Tonality in Real Time

Daniel Harasim, Fabian Claude Moss

This paper presents a web application for visualizing the tonality of a piece of music-the organization of its chords and scales-at a high level of abstraction and with coordinated playback. The application applies the discrete Fourier transform to the pit ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

LHC Schottky Spectrum from Macro-Particle Simulations

Tatiana Pieloni, Nicolas Frank Mounet, Christophe Emmanuel R. Lannoy

We introduce a method for building Schottky spectra from macro-particle simulations performed with the PyHEADTAIL code, applied to LHC beam conditions. In this case, the use of a standard Fast Fourier Transform (FFT) algorithm to recover the spectral conte ...

JACoW Publishing2022

On discrete Fourier uniqueness sets in Euclidean space

Maryna Viazovska

In this paper we present a new construction of a discrete Fourier uniqueness set in Euclidean space. ...

ICM2022

Localization errors of the stochastic heat equation

David Jean-Michel Candil

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

EPFL2022

Page 2 sur 2