Skip to content

Author

G. Karniadakis

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Fixed and Adaptive Topological DeepONets: Functional Measurements on Hausdorff Locally Convex Spaces

Deep Operator Networks (DeepONets; arXiv:1910.03193) typically encode an input function through point values on a fixed discretization. Building on the Topological DeepONet framework of Ismailov (arXiv:2603.11972), we replace point samples by continuous linear functionals drawn from the continuous dual of a Hausdorff locally convex space $({V},\{p_\alpha\}_{\alpha\in A})$, whose topology is generated by a point-separating family of seminorms rather than a single norm, and develop fixed and adaptive functional measurement systems. Measurements are combined with the coefficient-space Two-Step procedure of Lee and Shin (arXiv:2309.01020), while a training-only decoder and regularization stabilize the adaptive coordinates. We derive a discrete error decomposition separating measurement, output-basis, and neural-approximation errors, together with a Barron-rate refinement. The framework is evaluated on the antiderivative operator, a non-normable locally convex input space, heterogeneous Darcy flow, a controlled operator, and fixed-time and time-evolving Navier-Stokes vorticity operators. In the heterogeneous Darcy problem, the functional models retain nearly resolution-independent errors of 5.5-5.6% on unseen grids, while in the controlled problem adaptive measurements reduce the mean error below 1.2%. For the fixed-time Navier-Stokes problem, the Adaptive Topological DeepONet is the most accurate DeepONet-based model, attaining a mean relative $L^2$ error of 1.685% +/- 0.017% using 128 functional coordinates. A comparably sized Fourier neural operator (FNO; arXiv:2010.08895) achieves the lower error 0.832% +/- 0.172%, but requires the full 64x64 input field, twice the training time, and 10.7x greater peak GPU memory. The formulation provides compact, interpretable, and discretization-portable coordinates in the continuous dual $V'$, including for non-normable input spaces.

Khemraj Shukla, G. Karniadakis · 0 citations
Preprint Jul 2026

Generalizable turbulence closures across bluff-body shapes by PINN-based solver-agnostic training

Data-driven turbulence closures are usually calibrated by inverse methods that embed a CFD solver in the loop, tying the model to a particular discretization and requiring every iterate to yield a convergent solve. We instead train the closure inside a physics-informed neural network (PINN): the Reynolds-averaged Navier-Stokes residual is imposed by automatic differentiation, so the inverse problem is mesh-free, differentiable, and solver-agnostic. Because no forward solve runs during training, only the final closure need be solver-stable, arbitrary neural closures are admitted without an adjoint, and the iterative cost of adjoint or ensemble methods vanishes; each hypothesis trains in minutes on a single GPU, so the framework rapidly screens closure forms. We develop four closures: three model the Reynolds stress on a realizable tensor basis -- a local map, a non-local model transporting the turbulent kinetic energy and recovering the out-of-plane normal stress, and the same with a learned length scale l -- and a fourth models the Reynolds force F = -\nabla \cdot \tau directly, free of the realizability constraint. All four are trained across six two-dimensional bluff-body wakes at Re = 10^4 and deployed frozen in a standard finite-element solver, stabilized by input-gradient smoothing and a Lipschitz constraint. Under a strict leave-one-shape-out (LOSO) protocol, all four improve substantially on a steady SST k-omega baseline. The learned-length-scale closure is most accurate on the stress fields, while the force model generalizes best on the mean velocity and drag (LOSO drag error ~8.5%). The closures also train efficiently on Particle Image Velocimetry data, enabling geometries intractable for DNS.

Zhen Zhang, T. Kaufer, Louise Ronglan et al. · 0 citations