Learning-guided Kansa collocation for forward and inverse PDEs beyond linearity
Zheyuan Hu, Weitao Chen, Cengiz Öztireli, Chenliang Zhou, Fangcheng Zhong
TL;DR
This work extends the CNF-based learning framework to multi-variable and nonlinear PDEs using Kansa collocation with Gaussian RBFs, enabling forward, inverse, and discovery tasks in a mesh-free setting. It introduces coupled-field and nonlinear operator extensions, various time-stepping strategies, and auto-tuning of hyperparameters, complemented by a comprehensive empirical benchmark against classical and neural PDE solvers across Advection, Lotka-Volterra, Maxwell, and Burgers problems. The results show that learning-guided Kansa solvers can achieve competitive accuracy and efficiency, with distinct trade-offs in stability and training cost, and demonstrate robust inverse parameter recovery. The study provides practical insights into solver performance, scalability, and integration potential with differentiable pipelines in scientific computing contexts.
Abstract
Partial Differential Equations are precise in modelling the physical, biological and graphical phenomena. However, the numerical methods suffer from the curse of dimensionality, high computation costs and domain-specific discretization. We aim to explore pros and cons of different PDE solvers, and apply them to specific scientific simulation problems, including forwarding solution, inverse problems and equations discovery. In particular, we extend the recent CNF (NeurIPS 2023) framework solver to multi-dependent-variable and non-linear settings, together with down-stream applications. The outcomes include implementation of selected methods, self-tuning techniques, evaluation on benchmark problems and a comprehensive survey of neural PDE solvers and scientific simulation applications.
