About optimal loss function for training physics-informed neural networks under respecting causality

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

1. Apparenté Pas pertinent

   An overview on deep learning-based approximation methods for partial differential equations

   Christian Beck, Martin Hutzenthaler, Arnulf Jentzen et al. · 2020 · Discrete Contin. Dyn. Syst. Ser. B 28 (2023), no. 6, 3697-3746 · Résumé IA disponible

   Résumé scientifique

   It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). Recently, several deep learning-based approximation algorithms for attacking this problem have been proposed and tested numerically on a number of examples of high-dimensional PDEs. This has given rise to a lively field of research in which deep learning-based methods and related Monte Carlo methods are applied to the approximation of high-dimensional PDEs. In this article we offer an introduction to this field of research by revisiting selected mathematical results related to deep learning approximation methods for PDEs and reviewing the main ide…

2. Apparenté Pas pertinent

   A robust solution strategy for the Cahn-Larché equations

   Erlend Storvik, Jakub Wiktor Both, Jan Martin Nordbotten et al. · 2022 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   In this paper we propose a solution strategy for the Cahn-Larch\'e equations, which is a model for linearized elasticity in a medium with two elastic phases that evolve subject to a Ginzburg-Landau type energy functional. The system can be seen as a combination of the Cahn-Hilliard regularized interface equation and linearized elasticity, and is non-linearly coupled, has a fourth order term that comes from the Cahn-Hilliard subsystem, and is non-convex and nonlinear in both the phase-field and displacement variables. We propose a novel semi-implicit discretization in time that uses a standard convex-concave splitting method of the nonlinear double-well potential, as well as special treatment…

3. Apparenté Pas pertinent

   A Computationally Efficient Vectorized Implementation of Localizing Gradient Damage Method in MATLAB

   Subrato Sarkar · 2023 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   In this work, a recently developed fracture modeling method called localizing gradient damage method (LGDM) is implemented in MATLAB. MATLAB is well-known in the computational research community for its simple and easy-to-learn coding interface. As a result, MATLAB is generally preferred for the initial development (prototyping) of computational models by researchers. However, MATLAB-developed codes are seldom used for large-scale simulations (after initial development is complete) due to their computational inefficiency. Hence, a computationally efficient implementation of LGDM using MATLAB vectorization is presented in this work. The choice of LGDM (as the fracture modeling method) is base…

4. Apparenté Pas pertinent

   Solving Backward Doubly Stochastic Differential Equations through Splitting Schemes

   Feng Bao, Yanzhao Cao, He Zhang · 2021 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   A splitting scheme for backward doubly stochastic differential equations is proposed. The main idea is to decompose a backward doubly stochastic differential equation into a backward stochastic differential equation and a stochastic differential equation. The backward stochastic differential equation and the stochastic differential equation are then approximated by first order finite difference schemes, which results in a first order scheme for the backward doubly stochastic differential equation. Numerical experiments are conducted to illustrate the convergence rate of the proposed scheme.

5. Apparenté Pas pertinent

   Provably stable numerical method for the anisotropic diffusion equation in toroidally confined magnetic fields

   Dean Muir, Kenneth Duru, Matthew Hole et al. · 2023 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   We present a novel numerical method for solving the anisotropic diffusion equation in toroidally confined magnetic fields which is efficient, accurate and provably stable. The continuous problem is written in terms of a derivative operator for the perpendicular transport and a linear operator, obtained through field line tracing, for the parallel transport. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing …

6. Apparenté Pas pertinent

   Smooth multi-patch scaled boundary isogeometric analysis for Kirchhoff-Love shells

   Mathias Reichle, Jeremias Arf, Bernd Simeon et al. · 2023 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   In this work, a linear Kirchhoff-Love shell formulation in the framework of scaled boundary isogeometric analysis is presented that aims to provide a simple approach to trimming for NURBS-based shell analysis. To obtain a global C1-regular test function space for the shell discretization, an inter-patch coupling is applied with adjusted basis functions in the vicinity of the scaling center to ensure the approximation ability. Doing so, the scaled boundary geometries are related to the concept of analysis-suitable G1 parametrizations. This yields a coupling of patch boundaries in a strong sense that is restricted to G1-smooth surfaces. The proposed approach is advantageous to trimmed geometri…

7. Apparenté Pas pertinent

   Convergence of an adaptive $C^0$-interior penalty Galerkin method for the biharmonic problem

   Alexander Dominicus, Fernando Gaspoz, Christian Kreuzer · 2019 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   We develop a basic convergence analysis for an adaptive $\textsf{C}^0\textsf{IPG}$ method for the Biharmonic problem, which provides convergence without rates for all practically relevant marking strategies and all penalty parameters assuring coercivity of the method. The analysis hinges on embedding properties of (broken) Sobolev and BV spaces, and the construction of a suitable limit space. In contrast to the convergence result of adaptive discontinuous Galerkin methods for elliptic PDEs, by Kreuzer and Georgoulis [Math. Comp. 87 (2018), no.~314, 2611--2640], here we have to deal with the fact that the Lagrange finite element spaces may possibly contain no proper $C^1$-conforming subspace.…

8. Apparenté Pas pertinent

   The mpEDMD Algorithm for Data-Driven Computations of Measure-Preserving Dynamical Systems

   Matthew J. Colbrook · 2022 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   Koopman operators globally linearize nonlinear dynamical systems and their spectral information is a powerful tool for the analysis and decomposition of nonlinear dynamical systems. However, Koopman operators are infinite-dimensional, and computing their spectral information is a considerable challenge. We introduce measure-preserving extended dynamic mode decomposition ($\texttt{mpEDMD}$), the first truncation method whose eigendecomposition converges to the spectral quantities of Koopman operators for general measure-preserving dynamical systems. $\texttt{mpEDMD}$ is a data-driven algorithm based on an orthogonal Procrustes problem that enforces measure-preserving truncations of Koopman op…