Search arXivSearch

arXiv · 1707.05741

Analysis of blow-ups for the double obstacle problem in dimension two

Abstract

In this article we study a normalised double obstacle problem with polynomial obstacles $ p^1\leq p^2$ under the assumption that $ p^1(x)=p^2(x)$ iff $ x=0$. In dimension two we give a complete characterisation of blow-up solutions depending on the coefficients of the polynomials $p^1, p^2$. In particular, we see that there exists a new type of blow-ups, that we call double-cone solutions since the coincidence sets $\{u=p^1\}$ and $\{u=p^2\}$ are cones with a common vertex. We prove the uniqueness of blow-up limits, and analyse the regularity of the free boundary in dimension two. In particular we show that if the solution to the double obstacle problem has a double-cone blow-up limit at the origin, then locally the free boundary consists of four $C^{1,γ}$-curves, meeting at the origin. In the end we give an example of a three-dimensional double-cone solution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gohar Aleksanyan. 2017-07-18. Analysis of blow-ups for the double obstacle problem in dimension two. https://doi.org/10.4171/ifb%2F419

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Two-layers neural networks for Schr{ö}dinger eigenvalue problems

The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of high-dimensional Schr{ö}dinger eigenvalue problems with smooth interaction potentials and Neumann boundary condition on the unit cube in any dimension. More precisely, any eigenfunction associated to the lowest eigenvalue of the Schr{ö}dinger operator is a unit L 2 norm minimizer of the associated energy. Using Barron's representation of the solution with a probability measure defined on the set of parameter values and following the approach initially suggested by Bach and Chizat [1], the energy is minimized thanks to a constrained gradient curve dynamic on the 2-Wasserstein space of the set of parameter values defining the neural network. We prove the existence of solutions to this constrained gradient curve. Furthermore, we prove that, if it converges, the represented function is then an eigenfunction of the considered Schr{ö}dinger operator. At least up to our knowledge, this is the first work where this type of analysis is carried out to deal with the minimization of non-convex functionals.

math.AP

Validity of Prandtl Expansion for Steady Compressible Navier-Stokes-Fourier Flows

Assume no-slip boundary conditions for the velocity field and either insulated or Dirichlet boundary conditions for the temperature field in a steady compressible fluid. In the inviscid limit $\v \rightarrow 0$, we develop a mathematical framework for the uniform-in-$\v$ remainder estimate for the linear steady compressible Navier-Stokes-Fourier equations around a Prandtl layer profile with both velocity and thermal layers, which leads to the validity of the Prandtl layer expansion.

math.AP

Long time behaviour of Mean Field Games with fractional diffusion

In this paper we study the long time behaviour of mean field games systems with fractional diffusion, modeling the case that the individual dynamics of the players is driven by independent jump processes and controlled through the drift term, while being confined by an external field in order to guarantee ergodicity. In the case of globally Lipschitz, locally uniformly convex Hamiltonian, and weakly coupled costs satisfying the Lasry-Lions monotonicity condition, we prove that there is a unique solution $(u_T,m_T)$ to the mean field game problem in $(0,T)$ and we show that, if $T$ is sufficiently large, $(u_T,m_T)$ satisfies the so-called turnpike property, namely it is exponentially close to the (unique) stationary ergodic state for any proportionally long intermediate time.

math.AP