Searcharxiv⌕ Search

SEARCH · Searcharxiv

Search Searcharxiv

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

39 records · Page 3Linked to original sources

Physics-informed neural networks by Gradient-Guided Gaussian Adaptive Sampling (3GAS-PINNs)

Physics-informed neural networks (PINNs) provide a mesh-free framework for solving partial differential equations, yet their performance in nonlinear problems is often limited by slow convergence, gradient imbalance, and insufficient resolution to capture localized intermittent structures such as shock waves[1]. These issues arise primarily from the use of fixed weights of loss and uniform collocation point distributions, which cannot adapt to the evolving complexity of the solution field during training. To address these challenges, Gradient-Guided Gaussian Adaptive Sampling Physics-Informed Neural Networks (3GAS-PINNs) is proposed in this paper, which combines uniform probability distribution and Gaussian-smoothed probability distribution derived from the spatial gradients of solution, to maintain global constraint satisfaction as well as concentrating collocation points in regions of high gradient. Thus, intermittency structures like shock wave and solitons can be accurately captured. The method is evaluated on three benchmark nonlinear problems, including one-dimensional forced Burgers equation, Korteweg-de Vries (KdV) equation and nonlinear Schrodinger equation, all of which exhibit steep gradients or strong nonlinearity. In comparison with baseline PINNs, 3GAS-PINNs can effectively promote the physical consistency in intermittent regions. The accuracy of the numerical simulation can be improved by a factor of up to 14.

cs.LG↗

Spatial symmetry invariance of solution of Kolmogorov flow

We prove a mathematical theorem that solution for all $t > 0$ of the two-dimensional (2D) Kolmogorov flow governed by Navier-Stokes (NS) equations with periodic boundary condition keeps the same spatial symmetry as its smooth initial condition. The proof of a similar theorem for the three-dimensional NS equations is given in the appendix. These mathematical theorems can be used to check the correctness and reliability of numerical simulations of NS turbulence. For example, they support the corresponding CNS (clean numerical simulation) results of the 2D and 3D turbulent Kolmogorov flows [1-3] that remain the same spatial symmetry in the whole time interval of simulation, but do not support the corresponding DNS (direct numerical simulation) results that lose the spatial symmetry quickly. In other words, these DNS results violate these mathematical theorems. Thus, these mathematical theorems rigorously confirm that the spatiotemporal trajectories of NS turbulence given by DNS are indeed quickly polluted by numerical noises badly. All of these indicate that CNS can indeed provide helpful enlightenments to deepen our understanding about turbulence and besides approach some mathematical truths about NS equations.

physics.flu-dyn↗

A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions

We introduce a neural-preconditioned iterative solver for Poisson equations with mixed boundary conditions. Typical Poisson discretizations yield large, ill-conditioned linear systems. Iterative solvers can be effective for these problems, but only when equipped with powerful preconditioners. Unfortunately, effective preconditioners like multigrid require costly setup phases that must be re-executed every time domain shapes or boundary conditions change, forming a severe bottleneck for problems with evolving boundaries. In contrast, we present a neural preconditioner trained to efficiently approximate the inverse of the discrete Laplacian in the presence of such changes. Our approach generalizes to domain shapes, boundary conditions, and grid sizes outside the training set. The key to our preconditioner's success is a novel, lightweight neural network architecture featuring spatially varying convolution kernels and supporting fast inference. We demonstrate that our solver outperforms state-of-the-art methods like algebraic multigrid as well as recently proposed neural preconditioners on challenging test cases arising from incompressible fluid simulations.

math.NA↗