cs.LGOct 6, 2024

Graph Fourier Neural Kernels: Learning Full PDE Trajectories Across Geometries and Anisotropic Parameter Fields

Authors: Shane E. Loeffler, Zan Ahmad, Shiyi Chen, Syed Yusuf Ali, Carolyna Yamamoto, Kensuke Sakata, Dan M. Popescu, Alana Yee, 

Organizations: Johns Hopkins University, Department of Biomedical Engineering · Johns Hopkins University, Department of Applied Mathematics and Statistics

Abstract

High-fidelity simulations of time-dependent nonlinear partial differential equations (PDEs) are expensive to repeat across families of domains and parameter fields, a cost that recurs in design optimization, uncertainty quantification, and computational medicine. Most neural-operator surrogates require each domain to be mapped onto a common grid or reference shape, and few predict the full time course. We introduce Graph Fourier Neural Kernels (G-FuNK), a neural operator for second-order semilinear PDEs with a diffusive principal part that transfers across geometries and anisotropic diffusion tensors without coordinate maps or diffeomorphisms. A weighted graph and its Laplacian supply a spectral basis that encodes geometry and anisotropy. Shared layers act in this basis, at a cost linear in mesh size after one partial eigendecomposition per geometry, and a neural ODE integrator propagates the learned generator to full spatiotemporal trajectories on unseen domains. Across anisotropic heat flow, stiff reaction-diffusion, FitzHugh-Nagumo, and patient-specific left-atrial electrophysiology on CT-derived surfaces, G-FuNK reproduces held-out trajectories with relative L2L^2 error between 0.046 and 0.160. Its accuracy is comparable to that of a geometry-aware Fourier neural operator on regular domains, and its predictions are unchanged when a rectangular domain is rotated. On left atria, whose venous and valvular openings prevent mapping onto a reference shape, it predicts an 85-ms trajectory in under half a second, against about 5 minutes for finite elements, with a mean activation-time error of 1.73 ms. Accuracy depends on graph construction and is highest when the learned generator is integrated at its training time step.

Figures & tables

Appendix figures & tables10 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Aug 30, 2026

Joint Spatiotemporal Spectral Neural Operators for Learning PDEs on Irregular Domains

Learning solution operators for partial differential equations (PDEs) on irregular and geometry-dependent domains remains a central challenge in scientific machine learning. While spectral methods provide strong inductive biases for modeling global interactions, they are typically limited to regular domains, and existing neural approaches often require domain warping, interpolation, or costly geometric embeddings. We introduce the Graph Spectral Neural Operator (GSNO), a neural operator that combines spatial graph spectral decompositions with temporal Fourier transforms through a unified space--time spectral kernel. This formulation enables globally coherent operator learning on non-Cartesian discretizations without domain warping or autoregressive rollouts. By replacing learned geometric embeddings with a graph Laplacian spectral basis, GSNO provides geometry-aware spectral learning with low parameter complexity. Across steady and unsteady PDE benchmarks on irregular and geometry-dependent domains, GSNO achieves strong accuracy with reduced runtime and parameter counts, while demonstrating robust zero-shot generalization across mesh resolutions and geometry families.
Aug 28, 2026

Euclidean Fourier Neural Operators

Fourier neural operators (FNOs) provide an efficient framework for learning mappings between function spaces as they are, by construction, independent of the grid resolution at which they are trained and evaluated. However, FNOs are not independent of the periodic domain they are applied to: their discrete spectral weights are indexed by integer Fourier mode numbers, which correspond to physical wavevectors. When applied to a different domain, the same trained weights act at different wavevectors, and the FNO silently represents a different operator. This makes FNOs unsuitable for tasks where transfer across domains is crucial. We propose Euclidean Fourier neural operators~(EFNOs) as a domain-independent alternative to FNOs. By parameterizing the spectral kernel as a continuous function of the physical wavevector, the EFNO can learn operators that act consistently across periodic domains of varying shape and size. We evaluate the EFNO on a simple heat equation and on a practically relevant materials science task of learning exchange-correlation potentials across different crystal structures, and demonstrate that the EFNO is able to generalize to unseen grid sizes and domains.
May 10, 2026

HS-FNO: History-Space Fourier Neural Operator for Non-Markovian Partial Differential Equations

Neural operators provide fast surrogate models for time-dependent partial differential equations, but their standard autoregressive use usually assumes that the instantaneous field u(t,⋅)u(t,\cdot) is a complete state. This assumption fails for delay equations, distributed-memory systems, and other non-Markovian dynamics: two trajectories may agree at time tt and nevertheless have different futures because their histories differ. We introduce the History-Space Fourier Neural Operator (HS-FNO), a neural operator for delay and memory-driven PDEs formulated on the lifted state ut(θ,x)=u(t+θ,x)u_t(θ,x)=u(t+θ,x), θ∈[−τ,0]θ\in[-τ,0]. The key computational step is to decompose one history-state update into a learned predictor for the newly exposed future slice and an exact shift-append transport for the portion of the history window already known from the previous state. This avoids learning deterministic history coordinates, reduces the learned output dimension, and enforces the natural discrete history update. We test HS-FNO on five benchmark families covering delayed reaction--diffusion, spatial epidemiology, nonlocal neural-field dynamics, delayed waves, and distributed-memory closures. Across ten random seeds, HS-FNO attains the lowest aggregate one-step, history-space, and rollout errors among the principal baselines. The largest gain occurs in autoregressive prediction, where aggregate rollout error decreases from 0.2410.241, 0.1880.188, and 0.1850.185 for current-state, lag-stack, and unconstrained history-to-history operators, respectively, to 0.0940.094. The same model uses fewer parameters than unconstrained history prediction. These results indicate that enforcing the discrete shift structure of history-state evolution is an effective inductive bias for non-Markovian PDE surrogate modeling.