Lecture

Self Similar Solutions and Stokes Second Problem

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 concept of self-similar solutions and the Stokes second problem, discussing the separation of variables, Fourier transform, Laplace transform, and non-dimensional polynomial magic ansatz. It also explores the conditions under which the equation remains the same and the Gaussian error function.

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

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (21)

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

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.

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.

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.

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.

Related lectures (64)

Stokes first problem: hydrodynamic separation of variables

Explores the application of separation of variables in hydrodynamics and the concept of self-similarity.

Signals, Instruments, and Systems: System Properties and Transforms

Introduces system properties, Laplace Transform, and analog filters for signal analysis.

Frequency Response of LTI Systems

Explores LTI systems, impulse response, convolution, system properties, and frequency response, including low-pass and band-pass filters.

Laplace Transform: Basics and Properties

Covers the basics of the Laplace transform, properties, and applications to LTI systems, including transfer function and frequency response.

Laplace Transform: Basics