Two neural-network-based methods for solving obstacle problems

DOI10.1016/J.CHAOS.2022.112313MaRDI QIDQ6381989arXivWikidataFDO

Authors Xinyue Evelyn Zhao, Wenrui Hao, Bei Hu

Publication date 2 November 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.CHAOS.2022.112313

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Neural networks for/in biological studies, artificial life and related topics (92B20)

arXiv classification

cs.NAmath.APmath.NA

Abstract: Two neural-network-based numerical schemes are proposed to solve the classical obstacle problems. The schemes are based on the universal approximation property of neural networks, and the cost functions are taken as the energy minimization of the obstacle problems. We rigorously prove the convergence of the two schemes and derive the convergence rates with the number of neurons $N$. In the simulations, we use two example problems (1-D & 2-D) to verify the convergence rate of the methods and the quality of the results.

This page was built for publication: Two neural-network-based methods for solving obstacle problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6381989)