Search arXiv⌕ Search

arXiv · 2009.03892

Neural-PDE: A RNN based neural network for solving time dependent PDEs

Abstract

Partial differential equations (PDEs) play a crucial role in studying a vast number of problems in science and engineering. Numerically solving nonlinear and/or high-dimensional PDEs is often a challenging task. Inspired by the traditional finite difference and finite elements methods and emerging advancements in machine learning, we propose a sequence deep learning framework called Neural-PDE, which allows to automatically learn governing rules of any time-dependent PDE system from existing data by using a bidirectional LSTM encoder, and predict the next n time steps data. One critical feature of our proposed framework is that the Neural-PDE is able to simultaneously learn and simulate the multiscale variables.We test the Neural-PDE by a range of examples from one-dimensional PDEs to a high-dimensional and nonlinear complex fluids model. The results show that the Neural-PDE is capable of learning the initial conditions, boundary conditions and differential operators without the knowledge of the specific form of a PDE system.In our experiments the Neural-PDE can efficiently extract the dynamics within 20 epochs training, and produces accurate predictions. Furthermore, unlike the traditional machine learning approaches in learning PDE such as CNN and MLP which require vast parameters for model precision, Neural-PDE shares parameters across all time steps, thus considerably reduces the computational complexity and leads to a fast learning algorithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yihao Hu, Tong Zhao, Shixin Xu, Zhiliang Xu, Lizhen Lin. 2022-01-09. Neural-PDE: A RNN based neural network for solving time dependent PDEs. https://arxiv.org/abs/2009.03892

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Uniform-in-time Strong Error Estimates of Tamed-FEM to Superlinear SPDEs driven by Multiplicative Noise

We establish sharp, uniform-in-time strong error estimates for a nonlinearity-explicit tamed finite element method (FEM) applied to a class of superlinear stochastic partial differential equations (SPDEs) driven by multiplicative noise, including the stochastic Allen--Cahn equation with a moderately thick interface. This tamed-FEM was first introduced in {\it Z. Liu and J. Shen, J. Sci. Comput., 109:Paper No. 61, 26, 2026} to ensure long-time unconditional stability and to preserve the Lyapunov structure of this class of SPDEs. We further prove that the scheme is exponentially ergodic and derive the convergence rate of the numerical invariant measure to the exact one in the Wasserstein-2 distance. Finally, we present numerical experiments that verify the ergodicity, sharpness, and time-independence of the strong convergence rates for this tamed-FEM.

math.NA↗

Solution Analysis of Tensor Equation $\mathcal{A} \ltimes \mathcal{X} \ltimes \mathcal{B}= \mathcal{C}$ via Semi Tensor Product with t-product

Tensor equations involving both left and right tensor operators arise naturally in applications where multidimensional data are coupled through transformations acting from both sides. Motivated by the need to analyze such equations, this manuscript investigates a detailed solution analysis of $\mathcal{A}\ltimes \mathcal{X}\ltimes \mathcal{B} = \mathcal{C}$ via the semi-tensor product with the $t$-product. The manuscript provides a more general framework that includes, as a special case, the tensor equation $\mathcal{A}\ltimes\mathcal{X}=\mathcal{B}$ considered in \cite{J.FathitensorequationAX=BunderSTP}. Necessary and sufficient conditions are derived for the existence of vector and matrix valued solutions. Explicit compatibility conditions are established, and constructive Moore-Penrose-inverse-based algorithms are provided for the vector and matrix valued cases. The computational complexity and execution times are compared for Discrete Fourier Transform(DFT) and Fast Fourier Transform(FFT) based \(t\)-product implementations. The practical relevance of the proposed framework is further demonstrated through a color image deblurring application. Examples throughout illustrate the theoretical results.

math.NA↗

A nonoverlapping spectral additive Schwarz method for interior penalty discontinuous Galerkin discretizations of Anisotropic Elliptic Problems

We design and analyze a nonoverlapping additive Schwarz preconditioner for interior penalty discontinuous Galerkin discretizations of anisotropic elliptic problems. The preconditioned method coupled with a Krylov subspace iteration is shown to be independent of the highly discontinuous (and anisotropic) jump coefficients as well as the subdomain size. To increase efficacy, various auxiliary spaces are considered to reduce the size of the coarse grid operator. We demonstrate how to modify the additive Schwarz preconditioner such that it is applicable to the nonsymmetric IPDG schemes. Several numerical experiments verify the theory and validate the robustness of the preconditioner.

math.NA↗