Metraipolis › archive › dc_0f2deddb917e

Numerical Study of Reported Multiple Solutions to a Cauchy Problem for the 2d Incompressible Euler Equations — arXiv:2609.11694

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11694
License (as archived)
CC0-1.0
Archived
2026-10-16T06:10:14.281Z
SHA-256 of the archived text
bb22ffe565c6f28d850e07d959496f8b5f18720dfa4a3accb5133c4218fba650
Stable URL of this page
https://metraipolis.com/documento/dc_0f2deddb917e

How to cite

Numerical Study of Reported Multiple Solutions to a Cauchy Problem for the 2d Incompressible Euler Equations — arXiv:2609.11694 — arXiv (en), https://arxiv.org/abs/2609.11694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0f2deddb917e (Metraipolis archive dc_0f2deddb917e, sha256 bb22ffe565c6f28d850e07d959496f8b5f18720dfa4a3accb5133c4218fba650)
BibTeX
@misc{dc0f2deddb917e,
  title = {Numerical Study of Reported Multiple Solutions to a Cauchy Problem for the 2d Incompressible Euler Equations — arXiv:2609.11694},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11694},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0f2deddb917e; sha256 bb22ffe565c6f28d850e07d959496f8b5f18720dfa4a3accb5133c4218fba650},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11694. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Bressan and Shen (2021) jointly with Bressan and Murray (2020) proposed a simple example of a Cauchy problem on $\mathbb{R}^2$, characterized by two key parameters, intended to yield nonunique weak solutions of the incompressible Euler equations. They suggest that a limiting process applied to two specific approximations of their example initial data yields two distinct solutions. Here we provide evidence coming from a carefully designed numerical procedure to support if, or when, this intriguing claim is valid. Some of the numerical challenges encountered in the present study are: (i) the proposed initial data is unbounded in a neighborhood of the origin, (ii) the proposed problem is posed on all of $\mathbb{R}^2$, (iii) several essential symmetries present in the true solution must be captured, (iv) the proposed example depends on two parameters which may be critically linked. We demonstrate that an extremely large computational domain is mathematically necessary to capture the core symmetries of the exact free-space problem. Accordingly we implement a nested-grid strategy specifically designed for its particular suitability and efficacy for the problem at hand. Our strategy also allows us to achieve extreme grid refinement in the region where solution accuracy is most critical. Within our nested-grid framework, we design an underlying discretization scheme that is high-order, robust, and fast. We consider a broad collection of allowable parameter pairs, but among all of them we find only one that may satisfy the suggested claim.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.NA).
Categorie arXiv: Analysis of PDEs (math.AP) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.11694 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:55:33.352Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).