Aug 2026· The Physics of Fluids· Vol 38· 0 citations· 47 references
TL;DR
Results demonstrate that graph connectivity, neural coefficient parameterization, and Galerkin residual evaluation can be integrated within a common mixed finite-element representation for physics-informed approximation on geometrically irregular domains.
Abstract
Physics-informed approximation of solutions to forward problems governed by partial differential equation on geometrically irregular domains become challenging when geometric representation, residual evaluation, and neural approximation are not consistently integrated. This study proposes a physics-informed graph Laplacian-augmented Kolmogorov–Arnold network (PI-GLaK) for approximating solutions to the steady incompressible Navier–Stokes equations in two-dimensional vascular geometries. The proposed framework establishes a coefficient-based neural parameterization of the velocity and pressure fields within a common mixed finite-element formulation. Mesh-induced graph connectivity, Laplacian-augmented Kolmogorov–Arnold network layers, and Galerkin residual evaluation are defined using the same Taylor–Hood finite-element representation. The proposed PI-GLaK was evaluated on aneurysm–bend, bifurcation, and stenosis–aneurysm configurations, and its performance was compared with that of a conventional physics-informed neural network (PINN) and a physics-informed graph Galerkin network (PI-GGN). The proposed PI-GLaK achieved total relative L2 errors of 0.048–0.069, compared with 0.017–8.98 for the conventional PINN and 1.03–3.24 for PI-GGN. The proposed PI-GLaK exhibited more consistent accuracy across the three configurations than the PINN baseline and substantially lower errors than the graph-based Galerkin baseline. A gradient-based analysis of the residual loss components characterized geometry-dependent interactions during training and their relationship to the optimization behavior of the proposed formulation. These results demonstrate that graph connectivity, neural coefficient parameterization, and Galerkin residual evaluation can be integrated within a common mixed finite-element representation for physics-informed approximation on geometrically irregular domains.
Kolmogorov-Arnold Networks (KANs), inspired by the Kolmogorov Arnold representation theorem, provide an interpretable alternative to multilayer perceptrons (MLPs) by using learnable activation functions on edges rather than fixed node activations. We propose a Physics-Informed Kolmogorov-Arnold Network (PI-KAN) framewo...
Findings demonstrate that Phys-GCN provides an accurate and efficient graph-based and physics-informed surrogate for steady flow-field reconstruction on non-uniform, unstructured meshes, thereby laying a solid foundation for future extensions to more complex three-dimensional and compressible flow configurations.
Hao-Ran Xie, Hao Zhou, Chang-Hao Yu et al.· SAE technical paper series· 0 citations
A mesh-free numerical framework based on \textit{Kolmogorov--Arnold Physics-Informed Neural Networks} (KAN-PINNs) is developed for the approximation of fourth-order elliptic boundary value problems, with specific application to the biharmonic equation governing thin plate deflection. Unlike conventional Multi-Layer Per...
We study free-boundary problems within a physics-informed framework using Kolmogorov-Arnold network (KAN) approximations. The proposed approach incorporates obstacle constraints, partial differential equation (PDE) inequalities, complementarity conditions, and boundary conditions through residual-based loss functions....
This study provides the first application of a PINN-based framework to cubic nonlinear shear-wave propagation in soft solids and out performs the baseline PINNs while requiring no simulation or experimental data for training.
V. Pratap, B. Tripathi· Engineering computations· 0 citations
This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field, a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a rep...
A. Yadav, Amiya Prakash Das, R. Annabattula· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.