{"title":"Approximations of Dispersive PDEs in the Presence of Low-Regularity Randomness","authors":"Yvonne Alama Bronsard, Yvain Bruned, Katharina Schratz","doi":"10.1007/s10208-023-09625-8","DOIUrl":null,"url":null,"abstract":"<p>We introduce a new class of numerical schemes which allow for low-regularity approximations to the expectation <span>\\( \\mathbb {E}(|u_{k}(t, v^{\\eta })|^2)\\)</span>, where <span>\\(u_k\\)</span> denotes the <i>k</i>-th Fourier coefficient of the solution <i>u</i> of the dispersive equation and <span>\\( v^{\\eta }(x) \\)</span> the associated random initial data. This quantity plays an important role in physics, in particular in the study of wave turbulence where one needs to adopt a statistical approach in order to obtain deep insight into the <i>generic</i> long-time behaviour of solutions to dispersive equations. Our new class of schemes is based on Wick’s theorem and Feynman diagrams together with a resonance-based discretisation (Bruned and Schratz in Forum Math Pi 10:E2, 2022) set in a more general context: we introduce a novel combinatorial structure called paired decorated forests which are two decorated trees whose decorations on the leaves come in pair. The character of the scheme draws its inspiration from the treatment of singular stochastic partial differential equations via regularity structures. In contrast to classical approaches, we do not discretise the PDE itself, but rather its expectation. This allows us to heavily exploit the optimal resonance structure and underlying gain in regularity on the finite dimensional (discrete) level.</p>","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"16 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10208-023-09625-8","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce a new class of numerical schemes which allow for low-regularity approximations to the expectation \( \mathbb {E}(|u_{k}(t, v^{\eta })|^2)\), where \(u_k\) denotes the k-th Fourier coefficient of the solution u of the dispersive equation and \( v^{\eta }(x) \) the associated random initial data. This quantity plays an important role in physics, in particular in the study of wave turbulence where one needs to adopt a statistical approach in order to obtain deep insight into the generic long-time behaviour of solutions to dispersive equations. Our new class of schemes is based on Wick’s theorem and Feynman diagrams together with a resonance-based discretisation (Bruned and Schratz in Forum Math Pi 10:E2, 2022) set in a more general context: we introduce a novel combinatorial structure called paired decorated forests which are two decorated trees whose decorations on the leaves come in pair. The character of the scheme draws its inspiration from the treatment of singular stochastic partial differential equations via regularity structures. In contrast to classical approaches, we do not discretise the PDE itself, but rather its expectation. This allows us to heavily exploit the optimal resonance structure and underlying gain in regularity on the finite dimensional (discrete) level.
期刊介绍:
Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer.
With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles.
The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.