Searcharxiv⌕ Search

arXiv · 2610.26931

Matrix-Free Resolvent Analysis for Large-Scale Aerodynamic Systems

Abstract

Predicting transonic buffet requires resolving both flow stability and disturbance amplification. Resolvent analysis gives the amplification. However, each gain needs the solution of tens of linear systems with the shifted Jacobian and its adjoint. Sparse direct factorization, the usual route, is extrapolated to need more than $130$ TB for a three-dimensional jet with $4\times 10^{7}$ unknowns. For the stiff Reynolds-averaged operator of a transonic wing, iterative solution has been reported to stall on the adjoint system. To avoid the direct factorization and to converge the adjoint, we present a matrix-free resolvent framework in the Reynolds-averaged Navier-Stokes solver ADflow that combines automatic differentiation, Krylov solution with subspace recycling, and Lanczos bidiagonalization, with backward-error checks on each singular triplet. A three-level study of the NASA Common Research Model wing reaches $1.73\times 10^{8}$ complex unknowns. The coarsest grid predicts an unstable buffet mode, whereas no unstable eigenvalue is found on the finer grids within the shifts searched. The finer-grid gain peaks are consistent with collective amplification by damped modes, whose responses retain the buffet-cell structure and travel outboard at approximately $0.3$ of the free-stream speed. The peak gain remains sensitive to resolution despite these similar structures. These findings motivate future mesh adaptation targeted at convergence of flow stability and disturbance amplification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rohit Sunil Kanchi, Sicheng He. 2026-10-25. Matrix-Free Resolvent Analysis for Large-Scale Aerodynamic Systems. https://arxiv.org/abs/2610.26931

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

KEEP EXPLORING

Related papers

Physics-Informed Neural Networks for coupled stiff transport systems

Physics-Informed Neural Networks (PINN) struggle with stiff, regime-changing transport equations due to instability, loss imbalance, and violations of physical consistency. This paper investigates these failures through the Marshak wave equations, a canonical benchmark from radiative transport, where initial and boundary conditions differ by up to 12 orders of magnitude, and proposes modifications to the standard PINN framework to overcome them. Three modifications are introduced: a ScaledSigmoid final activation enforcing physical bounds and positivity of the unknowns; a logarithmic MSE loss replacing the standard quadratic loss for initial and boundary conditions, enabling training across extreme scale disparities; and explicit enforcement of global conservation laws as an additional physics loss term. Monte Carlo sampling with exponential time weighting is used throughout. The proposed framework recovers the Marshak wave dynamics - including the hot, cold, and wave-front regions - in good agreement with a reference Implicit Monte Carlo solution (sub-millimeter absolute error on the front position, although the relative error remains substantial at early times), with run times under 5 minutes. Ablation studies confirm that each ingredient is essential: linear activation, absence of the logarithmic loss, or removal of the PDE term each independently cause the method to fail qualitatively. This work identifies and resolves three concrete failure modes of standard PINN on stiff hyperbolic systems with nonlinear coupling. The combination of bounded activations, scale-aware loss functions, and conservation law enforcement constitutes a framework validated on the present one-dimensional Marshak wave problem, with potential extension to other coupled stiff transport systems in engineering.

physics.comp-ph↗

Towards Exact Multidimensional Fluxes: A Structure-Preserving Data-Informed Framework for Riemann Solvers

Finite-volume and discontinuous Galerkin methods update cells using the space-time flux integral over their faces, which typically depends on the solutions to local Riemann problems. In the multidimensional Riemann problem setting, this integral is difficult to evaluate exactly because of complex wave interactions. In this work, we show that the exact space-time flux integral is a polynomial in the time step and face dimensions. This motivates a learning-based approach, as only the mapping from the initial states to the polynomial coefficients needs to be learned. We propose a structure-preserving, data-informed Riemann solver framework that uses a neural network trained on high-resolution simulation data to learn this mapping. Key structural properties, including consistency and symmetry, are enforced by construction. Provided that the high-resolution simulations converge to the exact flux integrals and the network accurately predicts the coefficients, this framework yields near-exact flux integrals for use in numerical simulations. We demonstrate the framework using classical implosion and explosion problems for the two-dimensional Euler equations. In an unsplit MUSCL-Hancock scheme, the learned Riemann solver remains stable at a CFL number of 0.9, whereas the same scheme using the exact one-dimensional Riemann solver fails. Compared with the latter scheme at CFL=0.45, the learned scheme is slightly more accurate and requires approximately 30% less computational time.

physics.comp-ph↗

Machine learning kinetics from molecular dynamics data

Most molecular transitions occur on time scales far beyond direct molecular dynamics simulations. The committor, the probability that a configuration reaches a product state before a reactant state, is a central kinetic statistic, providing a mechanism-independent reaction coordinate and a foundation for transition path theory and the calculation of rates. This review surveys modern approaches for estimating the committor and related kinetic statistics from molecular simulations, with an emphasis on self-supervised methods that learn solutions of their defining dynamical equations rather than relying on labeled shooting data. We develop a common operator viewpoint connecting generator-based partial differential equations, variational principles, Markov state models, dynamical Galerkin approximation, and neural networks. Empirical and theoretical evidence points to the efficiency of these methods. We provide theoretical and practical guidance for realizing their full potential in applications, including strategies for treating non-Markovian effects and for sampling. We conclude by identifying opportunities for further research, including connections to reinforcement learning and generative modeling.

physics.comp-ph↗