How much can one learn from a single solution of a PDE?

06/10/2022
by   Hongkai Zhao, et al.
0

Linear evolution PDE ∂_t u(x,t) = -ℒ u, where ℒ is a strongly elliptic operator independent of time, is studied as an example to show if one can superpose snapshots of a single (or a finite number of) solution(s) to construct an arbitrary solution. Our study shows that it depends on the growth rate of the eigenvalues, μ_n, of ℒ in terms of n. When the statement is true, a simple data-driven approach for model reduction and approximation of an arbitrary solution of a PDE without knowing the underlying PDE is designed. Numerical experiments are presented to corroborate our analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2019

Data-Driven Deep Learning of Partial Differential Equations in Modal Space

We present a framework for recovering/approximating unknown time-depende...
research
05/18/2021

PDE-constrained Models with Neural Network Terms: Optimization and Global Convergence

Recent research has used deep learning to develop partial differential e...
research
07/08/2019

Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors

When solving linear systems arising from PDE discretizations, iterative ...
research
03/12/2021

Asymptotic Theory of ℓ_1-Regularized PDE Identification from a Single Noisy Trajectory

We prove the support recovery for a general class of linear and nonlinea...
research
02/27/2022

DeepPropNet – A Recursive Deep Propagator Neural Network for Learning Evolution PDE Operators

In this paper, we propose a deep neural network approximation to the evo...
research
04/25/2023

An explicit Fourier-Klibanov method for an age-dependent tumor growth model of Gompertz type

This paper proposes an explicit Fourier-Klibanov method as a new approxi...

Please sign up or login with your details

Forgot password? Click here to reset