Search arXivSearch

arXiv · 2306.12749

Physical informed neural networks with soft and hard boundary constraints for solving advection-diffusion equations using Fourier expansions

Abstract

Deep learning methods have gained considerable interest in the numerical solution of various partial differential equations (PDEs). One particular focus is physics-informed neural networks (PINN), which integrate physical principles into neural networks. This transforms the process of solving PDEs into optimization problems for neural networks. To address a collection of advection-diffusion equations (ADE) in a range of difficult circumstances, this paper proposes a novel network structure. This architecture integrates the solver, a multi-scale deep neural networks (MscaleDNN) utilized in the PINN method, with a hard constraint technique known as HCPINN. This method introduces a revised formulation of the desired solution for ADE by utilizing a loss function that incorporates the residuals of the governing equation and penalizes any deviations from the specified boundary and initial constraints. By surpassing the boundary constraints automatically, this method improves the accuracy and efficiency of the PINN technique. To address the ``spectral bias'' phenomenon in neural networks, a subnetwork structure of MscaleDNN and a Fourier-induced activation function are incorporated into the HCPINN, resulting in a hybrid approach called SFHCPINN. The effectiveness of SFHCPINN is demonstrated through various numerical experiments involving ADE in different dimensions. The numerical results indicate that SFHCPINN outperforms both standard PINN and its subnetwork version with Fourier feature embedding. It achieves remarkable accuracy and efficiency while effectively handling complex boundary conditions and high-frequency scenarios in ADE.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xi'an Li, Jiaxin Deng, Jinran Wu, Shaotong Zhang, Weide Li, You-Gan Wang. 2023-12-16. Physical informed neural networks with soft and hard boundary constraints for solving advection-diffusion equations using Fourier expansions. https://arxiv.org/abs/2306.12749

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

KEEP EXPLORING

Related papers

Equidistribution of saddle periodic points for Hénon-like maps

We prove that under a natural assumption on the dynamical degrees, the saddle periodic points of a Hénon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of the results of Bedford-Lyubich-Smillie, Dujardin, and Dinh-Sibony along with improvements of their techniques. We also investigate some fine properties of Green currents associated with the map.

math.DS

On dissonance and orthogonal projections of self-conformal measures

Let $μ$ be a self-conformal measure on $\mathbb{R}^d$. We establish conditions for $μ$ under which $\dim(μ*ν) = \min\lbrace d,\dimμ+\dimν\rbrace$ holds when $ν$ is any Ahlfors-regular or self-conformal measure on $\mathbb{R}^d$. Our main result states the following sufficient condition: $μ$ is totally non-linear and not supported on a smooth hypersurface. We also establish sufficient (likely non-sharp) algebraic conditions for self-conformal measures which are not totally non-linear. In addition, we show that $\dim μ\circπ^{-1} = \min\{ k, \dim μ\}$ for every ortohogonal projection $π:\mathbb{R}^d\to\mathbb{R}^k$, $0<k<d$, when either $d=2$ and $μ$ is not self-similar and not supported on a line, or $d\geq 3$ and $μ$ is totally non-linear and not supported on a smooth hypersurface.

math.DS

Equation-Free Screening of Mittag-Leffler-Compatible Dynamics from Scalar Time Series via kNN Multi-Horizon Profiles

Fractional models provide a natural description of systems with memory, but a noninteger derivative should not be introduced solely because a time series is curved or slowly relaxing. We develop an equation-free preliminary screening framework that asks whether a scalar time series produces a multi-horizon k-nearest-neighbor (kNN) profile more compatible with Mittag-Leffler-type behavior than with selected conventional alternatives. In an ideal matched Caputo-relaxation benchmark, the complete generation-kNN-profile-model-comparison pipeline reproduces the expected Mittag-Leffler geometry and recovers the generating order to within approximately $10^{-3}$; this is interpreted as controlled calibration rather than as general fractional-order identification. Under 3% trajectory-specific observational noise, the held-out Mittag-Leffler preference is most consistent when the generating dynamics are well separated from the integer-order limit and becomes progressively less decisive as $α\rightarrow1$. The fitted order $α_{\mathrm{fit}}$, however, shows substantially larger realization-to-realization variability. Thus, relative model compatibility is more robust than single-realization order estimation in the present noisy benchmark. Noise-free nonfractional controls show a separate limitation of specificity: a stretched exponential can generate a strongly Mittag-Leffler-compatible profile, whereas inclusion of the generating rational/Hill family recovers that family and its parameters to numerical precision in the matched setting. A positive Mittag-Leffler-versus-exponential screen therefore does not uniquely establish fractional origin. A fractional chaotic system is treated only as an exploratory extension: the Mittag-Leffler growth family gives lower finite-window RMSE than exponential and logistic/saturating alternatives over the detected pre-transition interval.

math.DS