Lecture

Stokes first problem: hydrodynamic separation of variables

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ME-444: Hydrodynamics

Nondimensionalized Navier-Stokes equations result in a great variety of models (Stokes, Lubrication, Euler, Potential) depending on the Reynolds number. The concept of boundary layer enables us then to identify the different components of the hydrodynamic ...

Description

This lecture covers the application of separation of variables in solving the Stokes first problem in hydrodynamics, discussing the limitations of Fourier and Laplace transforms, the magic ansatz method, and the concept of self-similarity in aggregation of variables. The instructor explains the process of transforming the problem into a single variable and the importance of non-dimensionalization. The lecture also touches on linear equations, initial conditions, and diffusion length. Various methods such as polynomial and sinusoidal ansatz are explored, along with the use of Wolfram for solutions.

Instructor

François Gallaire

google scholar https://scholar.google.ch/citations?hl=fr&user=T3OooAcAAAAJ François Gallaire earned his engineering degree from Ecole Polytechnique in 1998 and a master's in Liquids Physics from Université Pierre et Marie Curie in 1999. He completed his PhD in 2002 at LadHyX on swirling flow instabilities and vortex breakdown. After six years at the Mathematics department of Université de Nice, he joined EPFL in 2009, founding the Fluid Mechanics and Instabilities Lab (LFMI). He became an associate professo

Official source

Related concepts (32)

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Inverse Laplace transform

In mathematics, the inverse Laplace transform of a function F(s) is the piecewise-continuous and exponentially-restricted real function f(t) which has the property: where denotes the Laplace transform. It can be proven that, if a function F(s) has the inverse Laplace transform f(t), then f(t) is uniquely determined (considering functions which differ from each other only on a point set having Lebesgue measure zero as the same). This result was first proven by Mathias Lerch in 1903 and is known as Lerch's theorem.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Discrete-time Fourier transform

In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

Non-uniform discrete Fourier transform

In applied mathematics, the nonuniform discrete Fourier transform (NUDFT or NDFT) of a signal is a type of Fourier transform, related to a discrete Fourier transform or discrete-time Fourier transform, but in which the input signal is not sampled at equally spaced points or frequencies (or both). It is a generalization of the shifted DFT. It has important applications in signal processing, magnetic resonance imaging, and the numerical solution of partial differential equations.

Related lectures (64)

Fourier Transform: LTI Systems

Explores the Fourier transform application to LTI systems, including frequency response, convolution, differentiation, and solving differential equations.

Convolution and Laplace Transform

Explores control of dynamic systems, impulse response, Laplace transform, and Fourier transform for solving differential equations.

Partial Differential Equations: Heat Equation in R

Explores solving differential equations with periodic data using Fourier series and delves into the heat equation in R.

Partial Fraction Expansion

Introduces Partial Fraction Expansion as a valuable tool for analyzing stable LTI systems.

Stable LTI Systems: Frequency Response Analysis