PINNs Algorithmic Framework for Simulation of Nonlinear Burgers' Type Models

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Singh, Ajeet, Jiwari, Ram, Vikram, Saini, Ujjwal
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911007157256192
author Singh, Ajeet
Jiwari, Ram
Vikram
Saini, Ujjwal
author_facet Singh, Ajeet
Jiwari, Ram
Vikram
Saini, Ujjwal
contents In this work, a physics-informed neural networks (PINNs) based algorithm is used for simulation of nonlinear 1D and 2D Burgers' type models. This scheme relies on a neural network built to approximate the problem solution and use a trial function that meets the initial data and boundary criteria. First of all, a brief mathematical formulation of the problem and the structure of PINNs, including the neural network architecture, loss construction, and training methodology is described. Finally, the algorithm is demonstrated with five test problems involving variations of the 1D coupled, 2D single and 2D coupled Burgers' models. We compare the PINN-based solutions with exact results to assess accuracy and convergence of the developed algorithm. The results demonstrate that PINNs may faithfully replicate nonlinear PDE solutions and offer competitive performance in terms of inaccuracy and flexibility. This work demonstrates the potential of PINNs as a reliable approach to solving complex time-dependent PDEs.
format Preprint
id arxiv_https___arxiv_org_abs_2506_12922
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle PINNs Algorithmic Framework for Simulation of Nonlinear Burgers' Type Models
Singh, Ajeet
Jiwari, Ram
Vikram
Saini, Ujjwal
Machine Learning
In this work, a physics-informed neural networks (PINNs) based algorithm is used for simulation of nonlinear 1D and 2D Burgers' type models. This scheme relies on a neural network built to approximate the problem solution and use a trial function that meets the initial data and boundary criteria. First of all, a brief mathematical formulation of the problem and the structure of PINNs, including the neural network architecture, loss construction, and training methodology is described. Finally, the algorithm is demonstrated with five test problems involving variations of the 1D coupled, 2D single and 2D coupled Burgers' models. We compare the PINN-based solutions with exact results to assess accuracy and convergence of the developed algorithm. The results demonstrate that PINNs may faithfully replicate nonlinear PDE solutions and offer competitive performance in terms of inaccuracy and flexibility. This work demonstrates the potential of PINNs as a reliable approach to solving complex time-dependent PDEs.
title PINNs Algorithmic Framework for Simulation of Nonlinear Burgers' Type Models
topic Machine Learning
url https://arxiv.org/abs/2506.12922