Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.19486

A nonequilibrium-capturing unified gas-kinetic scheme I: discrete orthogonal basis construction and expansion on velocity space

Hongyu Liu·Kun Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Velocity space discretization is a primary source of computational cost in deterministic methods for multiscale gas flows. A fixed velocity grid often retains redundant kinetic degrees of freedom (DOFs), particularly under near equilibrium conditions. To address this issue, this work develops a nonequilibrium-capturing formulation based on the unified gas kinetic scheme (UGKS), in which the number of kinetic DOFs adapts locally to the degree of nonequilibrium. A discrete orthogonal basis is constructed for numerical implementation, and the velocity distribution function is decomposed into an analytical local equilibrium and a basis expanded nonequilibrium component. The retained, locally adapted DOFs are evolved directly, substantially lowering computational overhead while preserving the discrete conservation of mass, momentum, and energy, as well as accurately capturing nonequilibrium states. The formulation retains the core multiscale coupling of molecular transport and collision inherent to UGKS, providing explicit and implicit schemes for unsteady and steady flows, respectively. Numerical tests across a wide range of flow speeds and rarefaction regimes (from continuum to highly rarefied) demonstrate close agreement with benchmark solutions. For unsteady flows, the explicit scheme achieves speedups of 12.64 to 58.50 over the standard UGKS. In steady state tests, only about $2\%$ of the original kinetic DOFs are required in continuum regions, accelerating each implicit iteration by a factor of 33.87. Even in the most rarefied cases, the scheme captures nonequilibrium behavior using only about $27\%$ of the original DOFs.

Explore related subjects

physics.comp-phcs.NAmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hongyu Liu, Kun Xu. 2026-10-14. A nonequilibrium-capturing unified gas-kinetic scheme I: discrete orthogonal basis construction and expansion on velocity space. https://arxiv.org/abs/2610.19486

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

GeONet: Geometry-Encoded Operator Network for Predicting Flow in Heterogeneous Porous Media

Rapid prediction of pressure-driven flow in microfluidic porous media is important for experimental design, tracer-test interpretation, and digital-twin development for subsurface energy and critical mineral applications. High-fidelity simulations resolve geometry-controlled flow but are computationally expensive across large geometry ensembles. Here, we introduce GeONet, a Geometry-Encoded Operator Network that predicts steady-state pressure fields by jointly representing material properties, spatial coordinates, and solid--void geometry. GeONet extends the Branch--Trunk architecture with a dedicated Leaf Network encoding the binary domain mask through multiscale features. The Branch Network represents porosity and permeability, the Trunk Network combines coordinates with local geometric descriptors and random Fourier features, and a gated DeepMixer integrates these representations to predict pressure. GeONet was trained and evaluated using 5,000 PFLOTRAN simulations of heterogeneous Reduced Complexity Platform domains, comprising nearly 30 TB of data. Comparisons with pore-scale Stokes solutions across three geometries yielded Pearson correlations of 0.987--0.991 and $R^2$ values of 0.974--0.982, supporting PFLOTRAN as reference data. Under matched partitions and two-stage hyperparameter optimization, GeONet substantially outperformed a boundary-condition-aware DeepONet baseline. Across three held-out domains, GeONet achieved NRMSE of 0.0381--0.0500, MAPE of 1.76--2.59%, and $R^2$ of 0.9673--0.9822, versus 0.1483--0.2040, 7.81--10.45%, and 0.5658--0.7126 for DeepONet, respectively. On three additional unseen geometries, GeONet achieved NRMSE of 0.0448--0.0676 and $R^2$ of 0.9511--0.9770. These results demonstrate improved accuracy, pressure-range preservation, and cross-geometry generalization through explicit geometry encoding.

physics.comp-ph↗
arXiv2026

Online reduced-order modeling from primal solver trajectories for PDE-constrained optimization

Repeated high-fidelity state and gradient evaluations make large-scale PDE-constrained optimization computationally expensive. Reduced-order modeling provides a natural way to reduce the cost of these repeated high-dimensional computations. However, existing reduced-order modeling approaches often rely on converged high-fidelity states for model construction or updating, while their reduced spaces may lose accuracy as the design moves beyond the region represented by the available data. To address these limitations, we present Reduced-order Trajectory-based Optimization (RETO), an online framework that constructs local reduced-order models (ROMs) directly from unconverged primal solver trajectories. Each local ROM is built from snapshots collected during a finite number of high-fidelity primal iterations, without requiring full-order convergence, and supports multiple low-cost state evaluations, adjoint-based gradient evaluations, and design updates. New solver trajectories are generated at updated design points to reconstruct the local ROM and continue the optimization. Across three distinct PDE-constrained optimization problems, RETO achieves solution quality comparable to that of full-order optimization, with speedups of approximately 8 to 22 times in cases without discontinuities in the state fields. Even in the transonic inverse-design case involving moving shocks, RETO retains an approximately threefold speedup. The transonic results further show that the online local ROM progressively captures evolving shock-related flow features as new primal solver trajectories are incorporated. These results demonstrate the value of unconverged primal solver trajectories as an online information source for reduced-order optimization, allowing the reduced basis to evolve with the design rather than requiring a basis that covers the entire design space in advance.

physics.comp-ph↗
arXiv2026

Learning to reconstruct Germano Differential Filtered Fields with Convolutional Neural Networks for Large Eddy Simulation of Plasma Turbulence

We present a novel method which combines the invertibility of the differential filter of Germano, with convolutional networks to accelerate plasma turbulence simulations. Rather than learning the mapping from coarse-grid LES fields to fine-grid DNS, the proposed method learns the mapping from coarse LES fields to the differential-filtered DNS fields. We then use the inverse of Germano's filter to reconstruct the fine-scale details and hence calculate exactly the nonlinear terms in the governing equations and subgrid-scale terms in the LES equations. The method is tested on the 2D Hasegawa-Wakatani (HW) and modified Hasegawa-Wakatani (mHW) plasma turbulence models at $256^2$ and $512^2$ DNS resolutions using 2, 4 and 8 times smaller LES grids in each direction. We compare the model with DNS results on energy, enstrophy, spectra, probability distributions, poloidal and radial fluxes and computational cost. Validation extends to 1000 simulation time units for HW and 100 for mHW, whose faster dynamics lead toward laminarization. For the $256^2$ cases, the finer LES meshes preserve several integral and spectral features, whereas the coarsest mesh yields unphysical behavior. In contrast, for the $512^2$ cases, even the coarsest LES mesh preserves the turbulent character of the flow and maintains acceptable statistics for both the HW and mHW models. Moreover, we show how our methodology is superior to traditional algebraic numerical LES models, which traditionally fail to capture important design features. Finally, benchmarks show an MPI task-time reductions of 4.82--49.45, with a maximum wall-clock speedup of $1.55\times$ when compared to full CPU socket.

physics.comp-ph↗