These results demonstrate that high-order PDE problems can be accurately resolved using compact, mesh-free KAN-PINNs architecture without requiring auxiliary variable transformations or discrete mesh generation.
Abstract
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 Perceptrons relying on fixed nodal activations, learnable univariate functions parameterized via radial basis functions are deployed on network edges, while high-order differentiability is preserved through hyperbolic tangent activation mappings. The severe numerical stiffness inherent to fourth-order differential operators and fully clamped boundary conditions is addressed through a direct normalized residual formulation coupled with a hybrid, multi-stage AdamW-to-L-BFGS optimization pipeline. An automated \textit{24/7 hill-climbing search protocol} is implemented to systematically calibrate boundary penalty weights and optimization schedules. When evaluated on a smooth manufactured benchmark on the unit square, an error reduction factor exceeding $150\times$ is attained over successive iterations, culminating in a final relative $L_2$ error of $1.593 \times 10^{-5}$ ($0.00159\%$) and a training loss of $3.065 \times 10^{-6}$ utilizing only $7,801$ trainable parameters. These results demonstrate that high-order PDE problems can be accurately resolved using compact, mesh-free KAN-PINNs architecture without requiring auxiliary variable transformations or discrete mesh generation.
A controlled comparative study of a mesh-free Kolmogorov--Arnold Physics-Informed Neural Network (KAN-PINN) applied to nonlinear strain-limiting partial differential equations is presented. Three distinct training runs across varying material-parameter pairs $(\alpha, \beta)$ are evaluated within a fixed computational...
This paper presents a comparative study of classical numerical and machine learning techniques for solving the nonlinear Monge–Ampère Equation (MAE). A finite difference method (FDM) implemented in MATLAB is first validated using a quadratic exact solution on a square domain. Two neural network approaches are then inve...
C. Ogbonna, Maliki Olaniyi S, Nkem Ogbonna· International journal of re...· 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 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 work develops an error estimation framework that decomposes the total error into approximation, optimization, quadrature, and soft boundary/terminal-constraint contributions and derives a quantitative linearized stability estimate and a conditional local nonlinear residual-to-error estimate.
Full-order surrogates for high-dimensional nonlinear flows are often unnecessary when applications require only selected degrees of freedom. We propose reduced-order models that bypass full-state reconstruction by deploying graph neural networks (GNNs) directly on coarse meshes. Applied to parameterized 2D/3D confined...
Brener Ramos, William R. Wolf, T. D. Oliveira et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.