Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reverse approximation of gradient flows as Minimizing Movements: a conjecture by De Giorgi (1711.07256v1)

Published 20 Nov 2017 in math.CA and math.AP

Abstract: We consider the Cauchy problem for the gradient flow \begin{equation} \label{eq:81} \tag{$\star$} u'(t)=-\nabla\phi(u(t)),\quad t\ge 0;\quad u(0)=u_0, \end{equation} generated by a continuously differentiable function $\phi:\mathbb H \to \mathbb R$ in a Hilbert space $\mathbb H$ and study the reverse approximation of solutions to ($\star$) by the De Giorgi Minimizing Movement approach. We prove that if $\mathbb H$ has finite dimension and $\phi$ is quadratically bounded from below (in particular if $\phi$ is Lipschitz) then for every solution $u$ to ($\star$) (which may have an infinite number of solutions) there exist perturbations $\phi_\tau:\mathbb H \to \mathbb R \ (\tau>0)$ converging to $\phi$ in the Lipschitz norm such that $u$ can be approximated by the Minimizing Movement scheme generated by the recursive minimization of $\Phi(\tau,U,V):=\frac 1{2\tau}|V-U|2+ \phi_\tau(V)$: \begin{equation} \label{eq:abstract} \tag{$\star\star$} U_\taun\in \operatorname{argmin}{V\in \mathbb H} \Phi(\tau,U\tau{n-1},V)\quad n\in\mathbb N, \quad U_\tau0:=u_0. \end{equation} We show that the piecewise constant interpolations with time step $\tau > 0$ of all possible selections of solutions $(U_\taun)_{n\in\mathbb N}$ to ($\star\star$) will converge to $u$ as $\tau\downarrow 0$. This result solves a question raised by Ennio De Giorgi. We also show that even if $\mathbb H$ has infinite dimension the above approximation holds for the distinguished class of minimal solutions to ($\star$), that generate all the other solutions to ($\star$) by time reparametrization.

Summary

We haven't generated a summary for this paper yet.