2022
DOI: 10.48550/arxiv.2205.10230
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

RAR-PINN algorithm for the data-driven vector-soliton solutions and parameter discovery of coupled nonlinear equations

Abstract: This work aims to provide an effective deep learning framework to predict the vectorsoliton solutions of the coupled nonlinear equations and their interactions. The method we propose here is a physics-informed neural network (PINN) combining with the residual-based adaptive refinement (RAR-PINN) algorithm. Different from the traditional PINN algorithm which takes points randomly, the RAR-PINN algorithm uses an adaptive point-fetching approach to improve the training efficiency for the solutions with steep grad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 35 publications
0
1
0
Order By: Relevance
“…Alternatively, there exist approaches to directly represent the PDE solutions via NNs. To mention a few: [9,10] minimize the strong form of the residual via collocation methods; [11] proposes a Deep Ritz Method (DRM) for symmetric and positive definite problems; [12] introduces a Deep Fourier Method; and [13][14][15][16][17] propose (Petrov-)Galerkin frameworks in the context of trial NNs with test functions belonging to linear spaces. All these NN-based methods exhibit multiple features but also present several limitations (see, e.g., [18][19][20][21]).…”
Section: Introductionmentioning
confidence: 99%
“…Alternatively, there exist approaches to directly represent the PDE solutions via NNs. To mention a few: [9,10] minimize the strong form of the residual via collocation methods; [11] proposes a Deep Ritz Method (DRM) for symmetric and positive definite problems; [12] introduces a Deep Fourier Method; and [13][14][15][16][17] propose (Petrov-)Galerkin frameworks in the context of trial NNs with test functions belonging to linear spaces. All these NN-based methods exhibit multiple features but also present several limitations (see, e.g., [18][19][20][21]).…”
Section: Introductionmentioning
confidence: 99%