Gabriel Peyré's banner
Gabriel Peyré's profile picture

Gabriel Peyré

@gabrielpeyre100,458 subscribers

@CNRS researcher at @ENS_ULM. One tweet a day on computational mathematics.

Shorts

Mathematical modeling: part 1/2.

Mathematical modeling: part 1/2.

230,871 Aufrufe

Taylor series expansion of sine.

Taylor series expansion of sine.

304,980 Aufrufe

Fokker-Planck equation equivalently describes the movement of a random particle with a drift (as a stochastic ODE) and the evolution of its density (as a PDE).

Fokker-Planck equation equivalently describes the movement of a random particle with a drift (as a stochastic ODE) and the evolution of its density (as a PDE).

225,015 Aufrufe

Heat, Wave and Schrodinger equations are fundamental linear partial differential equations of physics.

Heat, Wave and Schrodinger equations are fundamental linear partial differential equations of physics.

232,051 Aufrufe

Comparison of the Wasserstein, Hellinger, Kullback-Leibler and reverse KL on the space of Gaussian distributions.

Comparison of the Wasserstein, Hellinger, Kullback-Leibler and reverse KL on the space of Gaussian distributions.

206,321 Aufrufe

Heat diffusion vs. wave equation on a surface.

Heat diffusion vs. wave equation on a surface.

205,103 Aufrufe

The marching squares/cubes is the standard algorithm to extract iso-curves/surfaces from a discretized image/volume.

The marching squares/cubes is the standard algorithm to extract iso-curves/surfaces from a discretized image/volume.

130,301 Aufrufe

Impact of the interpolation method on the level set of the resulting function.

Impact of the interpolation method on the level set of the resulting function.

125,307 Aufrufe

Oldies but goldies: L. Greengard and V. Rokhlin, A Fast Algorithm for Particle Simulations, 1987. Evaluates in O(n) in place of O(n^2) sums involving long-range interaction kernels.

Oldies but goldies: L. Greengard and V. Rokhlin, A Fast Algorithm for Particle Simulations, 1987. Evaluates in O(n) in place of O(n^2) sums involving long-range interaction kernels.

68,683 Aufrufe

Large-scale N-body simulations require the evaluation of sums involving long-range interaction kernels. Fast multipoles and Barnes–Hut methods approximate these sums in n*log(n) operations instead of n^2.

Large-scale N-body simulations require the evaluation of sums involving long-range interaction kernels. Fast multipoles and Barnes–Hut methods approximate these sums in n*log(n) operations instead of n^2.

74,699 Aufrufe

The Cucker-Smale system of ODEs is the simplest model of particles exhibiting flocking behaviors. Diffusion of speeds is governed by a Laplacian on the fully connected graph of points.

The Cucker-Smale system of ODEs is the simplest model of particles exhibiting flocking behaviors. Diffusion of speeds is governed by a Laplacian on the fully connected graph of points.

77,132 Aufrufe

The three ways to solve Fokker-Planck equations: PDE evolution, stochastic (independent) or deterministic (coupled) particle systems.

The three ways to solve Fokker-Planck equations: PDE evolution, stochastic (independent) or deterministic (coupled) particle systems.

85,275 Aufrufe

Laplacian eigenmaps perform non-linear dimensionality reduction ("manifold learning") by embedding data points using the eigenvectors of a graph Laplacian as coordinates.

Laplacian eigenmaps perform non-linear dimensionality reduction ("manifold learning") by embedding data points using the eigenvectors of a graph Laplacian as coordinates.

67,707 Aufrufe

Photo-realistic texture synthesis methods perform pixels, patches or more complicated features recopy from the input to the output.

Photo-realistic texture synthesis methods perform pixels, patches or more complicated features recopy from the input to the output.

56,340 Aufrufe

Interpolating at uniformly sampled point can suffer from Runge oscillations. Using Chebyshev nodes resolves this issue.

Interpolating at uniformly sampled point can suffer from Runge oscillations. Using Chebyshev nodes resolves this issue.

78,813 Aufrufe

Oldies but goldies: Y Nesterov, A method for solving a convex programming problem with convergence rate O(1/k^2). Improves the 1/k rate of vanilla gradient descent to 1/k^2.

Oldies but goldies: Y Nesterov, A method for solving a convex programming problem with convergence rate O(1/k^2). Improves the 1/k rate of vanilla gradient descent to 1/k^2.

47,616 Aufrufe

A ReLu network computes a piecewise linear approximation of a target function.

A ReLu network computes a piecewise linear approximation of a target function.

75,639 Aufrufe

Oldies but goldies: R. Keys, Cubic convolution interpolation for digital image processing, 1980. Introduces bicubic interpolation, the most frequently used image interpolation method.

Oldies but goldies: R. Keys, Cubic convolution interpolation for digital image processing, 1980. Introduces bicubic interpolation, the most frequently used image interpolation method.

37,779 Aufrufe

Stable fluids of Jos Stam is a semi-Lagrangian solver for Navier-Stokes, which was very influential in graphics because of its simplicity and stability.

Stable fluids of Jos Stam is a semi-Lagrangian solver for Navier-Stokes, which was very influential in graphics because of its simplicity and stability.

33,545 Aufrufe

Oldies but goldies: B Poljak, Some methods of speeding up the convergence of iteration methods, 1964. Introduces momentum methods to speed up gradient descent schemes.

Oldies but goldies: B Poljak, Some methods of speeding up the convergence of iteration methods, 1964. Introduces momentum methods to speed up gradient descent schemes.

27,808 Aufrufe

Videos

Keine weiteren Inhalte verfügbar