Solving Backward Doubly Stochastic Differential Equations through Splitting Schemes

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. Proche Pas pertinent

   DelayDiffEq: Generating Delay Differential Equation Solvers via Recursive Embedding of Ordinary Differential Equation Solvers

   David Widmann, Chris Rackauckas · 2022 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   Traditional solvers for delay differential equations (DDEs) are designed around only a single method and do not effectively use the infrastructure of their more-developed ordinary differential equation (ODE) counterparts. In this work we present DelayDiffEq, a Julia package for numerically solving delay differential equations (DDEs) which leverages the multitude of numerical algorithms in OrdinaryDiffEq for solving both stiff and non-stiff ODEs, and manages to solve challenging stiff DDEs. We describe how compiling the ODE integrator within itself, and accounting for discontinuity propagation, leads to a design that is effective for DDEs while using all of the ODE internals. We highlight som…

2. 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…

3. 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…

4. 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…

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

   Tensor-Product Split-Simplex Summation-By-Parts Operators

   Zelalem Arega Worku, Jason E. Hicken, David W. Zingg · 2024 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   We present an approach to construct efficient sparse summation-by-parts (SBP) operators on triangles and tetrahedra with a tensor-product structure. The operators are constructed by splitting the simplices into quadrilateral or hexahedral subdomains, mapping tensor-product SBP operators onto the subdomains, and assembling back using a continuous-Galerkin-type procedure. These tensor-product split-simplex operators do not have repeated degrees of freedom at the interior interfaces between the split subdomains. Furthermore, they satisfy the SBP property by construction, leading to stable discretizations. The accuracy and sparsity of the operators substantially enhance the efficiency of SBP dis…

7. Apparenté Pas pertinent

   Isomeric trees and the order of Runge--Kutta methods

   John C. Butcher, Helmut Podhaisky · 2021 · Analyse numérique · Résumé IA disponible

   Résumé scientifique

   The conditions for a Runge--Kutta method to be of order $p$ with $p\ge 5$ for a scalar non-autonomous problem are a proper subset of the order conditions for a vector problem. Nevertheless, Runge--Kutta methods that were derived historically only for scalar problems happened to be of the same order for vector problems. We relate the order conditions for scalar problems to factorisations of the Runge--Kutta trees into "atomic stumps" and enumerate those conditions up to $p=20$. Using a special search procedure over unsatisfied order conditions, new Runge--Kutta methods of "ambiguous orders" five and six are constructed. These are used to verify the validity of the results.

8. Apparenté Pas pertinent

   An embedded corrector problem for homogenization. Part II: Algorithms and discretization

   Eric Cancès, Virginie Ehrlacher, Frederic Legoll et al. · 2018 · Analyse numérique · Pas encore résumé

   Résumé scientifique

   This contribution is the numerically oriented companion article of the work [E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv preprint 1807.05131]. We focus here on the numerical resolution of the embedded corrector problem introduced in [E. Canc\`es, V. Ehrlacher, F. Legoll and B. Stamm, CRAS 2015; E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv preprint 1807.05131] in the context of homogenization of diffusion equations. Our approach consists in considering a corrector-type problem, posed on the whole space, but with a diffusion matrix which is constant outside some bounded domain. In [E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv p…