Table of Contents
Fetching ...

Soliton profiles: Classical Numerical Schemes vs. Neural Network - Based Solvers

Chandler Haight, Svetlana Roudenko, Zhongming Wang

TL;DR

The work systematically benchmarks classical numerical solvers against neural-network-based solvers for one-dimensional solitary-wave profiles governed by $Q''=bQ-\gamma Q^p$ across NLS, gKdV, and NLKG reductions. It finds that traditional finite-difference and Petviashvili methods deliver high accuracy and efficiency for single instances, while PINNs can approximate qualitative features but incur substantial training cost and slower convergence. Operator-learning approaches like DeepONet and FNO offer offline training to enable rapid, mesh-free inference across parameter regimes, with DeepONet generally outperforming FNO in this setting. The study highlights practical trade-offs and suggests avenues such as MoE architectures and physics-based activations to enhance neural solvers, while also detailing Dirichlet-boundary-induced order reduction in finite-difference schemes.

Abstract

We present a comparative study of classical numerical solvers, such as Petviashvili's method or finite difference with Newton iterations, and neural network-based methods for computing ground states or profiles of solitary-wave solutions to the one-dimensional dispersive PDEs that include the nonlinear Schrödinger, the nonlinear Klein-Gordon and the generalized KdV equations. We confirm that classical approaches retain high-order accuracy and strong computational efficiency for single-instance problems in the one-dimensional setting. Physics-informed neural networks (PINNs) are also able to reproduce qualitative solutions but are generally less accurate and less efficient in low dimensions than classical solvers due to expensive training and slow convergence. We also investigate the operator-learning methods, which, although computationally intensive during training, can be reused across many parameter instances, providing rapid inference after pretraining, making them attractive for applications involving repeated simulations or real-time predictions. For single-instance computations, however, the accuracy of operator-learning methods remains lower than that of classical methods or PINNs, in general.

Soliton profiles: Classical Numerical Schemes vs. Neural Network - Based Solvers

TL;DR

The work systematically benchmarks classical numerical solvers against neural-network-based solvers for one-dimensional solitary-wave profiles governed by across NLS, gKdV, and NLKG reductions. It finds that traditional finite-difference and Petviashvili methods deliver high accuracy and efficiency for single instances, while PINNs can approximate qualitative features but incur substantial training cost and slower convergence. Operator-learning approaches like DeepONet and FNO offer offline training to enable rapid, mesh-free inference across parameter regimes, with DeepONet generally outperforming FNO in this setting. The study highlights practical trade-offs and suggests avenues such as MoE architectures and physics-based activations to enhance neural solvers, while also detailing Dirichlet-boundary-induced order reduction in finite-difference schemes.

Abstract

We present a comparative study of classical numerical solvers, such as Petviashvili's method or finite difference with Newton iterations, and neural network-based methods for computing ground states or profiles of solitary-wave solutions to the one-dimensional dispersive PDEs that include the nonlinear Schrödinger, the nonlinear Klein-Gordon and the generalized KdV equations. We confirm that classical approaches retain high-order accuracy and strong computational efficiency for single-instance problems in the one-dimensional setting. Physics-informed neural networks (PINNs) are also able to reproduce qualitative solutions but are generally less accurate and less efficient in low dimensions than classical solvers due to expensive training and slow convergence. We also investigate the operator-learning methods, which, although computationally intensive during training, can be reused across many parameter instances, providing rapid inference after pretraining, making them attractive for applications involving repeated simulations or real-time predictions. For single-instance computations, however, the accuracy of operator-learning methods remains lower than that of classical methods or PINNs, in general.
Paper Structure (19 sections, 44 equations, 11 figures, 21 tables, 4 algorithms)

This paper contains 19 sections, 44 equations, 11 figures, 21 tables, 4 algorithms.

Figures (11)

  • Figure 0: $L_\infty$ error of the FD-Newton scheme (left) and the Petviashvili method (right) vs. grid number $N_{interior}$ (in log scale) for \ref{['2ndODE-finite']} with variable amplitude initialization, $Q_0 = kQ_{exact}(x),\, k=0.9,\, 1.0,\, 1.1$, $Tol=10^{-12}$.
  • Figure 0: $L_\infty$ error of the FD-Newton scheme (left) and the Petviashvili method (right) vs. tolerance $Tol$ for \ref{['2ndODE-finite']} with variable amplitude initialization, $Q_0 = kQ_{exact}(x),\, k=0.9,\, 1.0,\, 1.1$.
  • Figure 0: Comparison of convergences with iterations for the FD+Newton (left) and Petviashvili's (right) methods for \ref{['2ndODE-finite']} with $p=3$ and $u_0 = 0.9Q_{exact}(x)$.
  • Figure 0: $L^\infty$ error (left) and $L^2$ error (right) of the PINN with $\tanh$ activation vs. number of epochs for \ref{['2ndODE-finite']} for different architecture combinations of layers and neurons.
  • Figure 0: $L^\infty$ error (left) and $L^2$ error (right) of the PINN with different epoch number with tanh activation vs. number of interior points $N_f$ (on log scale).
  • ...and 6 more figures

Theorems & Definitions (2)

  • Remark 1
  • Remark 2