24.5LGMar 29, 2022
Stabilized Neural Ordinary Differential Equations for Long-Time Forecasting of Dynamical SystemsAlec J. Linot, Joshua W. Burby, Qi Tang et al.
In data-driven modeling of spatiotemporal phenomena careful consideration often needs to be made in capturing the dynamics of the high wavenumbers. This problem becomes especially challenging when the system of interest exhibits shocks or chaotic dynamics. We present a data-driven modeling method that accurately captures shocks and chaotic dynamics by proposing a novel architecture, stabilized neural ordinary differential equation (ODE). In our proposed architecture, we learn the right-hand-side (RHS) of an ODE by adding the outputs of two NN together where one learns a linear term and the other a nonlinear term. Specifically, we implement this by training a sparse linear convolutional NN to learn the linear term and a dense fully-connected nonlinear NN to learn the nonlinear term. This is in contrast with the standard neural ODE which involves training only a single NN for learning the RHS. We apply this setup to the viscous Burgers equation, which exhibits shocked behavior, and show better short-time tracking and prediction of the energy spectrum at high wavenumbers than a standard neural ODE. We also find that the stabilized neural ODE models are much more robust to noisy initial conditions than the standard neural ODE approach. We also apply this method to chaotic trajectories of the Kuramoto-Sivashinsky equation. In this case, stabilized neural ODEs keep long-time trajectories on the attractor, and are highly robust to noisy initial conditions, while standard neural ODEs fail at achieving either of these results. We conclude by demonstrating how stabilizing neural ODEs provide a natural extension for use in reduced-order modeling by projecting the dynamics onto the eigenvectors of the learned linear term.
1.2NAJan 13, 2015
Positivity-Preserving Finite Difference WENO Schemes with Constrained Transport for Ideal Magnetohydrodynamic EquationsAndrew J. Christlieb, Yuan Liu, Qi Tang et al.
In this paper, we utilize the maximum-principle-preserving flux limiting technique, originally designed for high order weighted essentially non-oscillatory (WENO) methods for scalar hyperbolic conservation laws, to develop a class of high order positivity-preserving finite difference WENO methods for the ideal magnetohydrodynamic (MHD) equations. Our schemes, under the constrained transport (CT) framework, can achieve high order accuracy, a discrete divergence-free condition and positivity of the numerical solution simultaneously. Numerical examples in 1D, 2D and 3D are provided to demonstrate the performance of the proposed method.
1.2NAJul 9, 2018
A high-order finite difference WENO scheme for ideal magnetohydrodynamics on curvilinear meshesAndrew J. Christlieb, Xiao Feng, Yan Jiang et al.
A high-order finite difference numerical scheme is developed for the ideal magnetohydrodynamic equations based on an alternative flux formulation of the weighted essentially non-oscillatory (WENO) scheme. It computes a high-order numerical flux by a Taylor expansion in space, with the lowest-order term solved from a Riemann solver and the higher-order terms constructed from physical fluxes by limited central differences. The scheme coupled with several Riemann solvers, including a Lax-Friedrichs solver and HLL-type solvers, is developed on general curvilinear meshes in two dimensions and verified on a number of benchmark problems. In particular, a HLLD solver on Cartesian meshes is extended to curvilinear meshes with proper modifications. A numerical boundary condition for the perfect electrical conductor (PEC) boundary is derived for general geometry and verified through a bow shock flow. Numerical results also confirm the advantages of using low dissipative Riemann solvers in the current framework.
1.2NAOct 31, 2015
An explicit high-order single-stage single-step positivity-preserving finite difference WENO method for the compressible Euler equationsDavid C. Seal, Qi Tang, Zhengfu Xu et al.
In this work we construct a high-order, single-stage, single-step positivity-preserving method for the compressible Euler equations. Space is discretized with the finite difference weighted essentially non-oscillatory (WENO) method. Time is discretized through a Lax-Wendroff procedure that is constructed from the Picard integral formulation (PIF) of the partial differential equation. The method can be viewed as a modified flux approach, where a linear combination of a low- and high-order flux defines the numerical flux used for a single-step update. The coefficients of the linear combination are constructed by solving a simple optimization problem at each time step. The high-order flux itself is constructed through the use of Taylor series and the Cauchy-Kowalewski procedure that incorporates higher-order terms. Numerical results in one- and two-dimensions are presented.
Approximation of nearly-periodic symplectic maps via structure-preserving neural networksValentin Duruisseaux, Joshua W. Burby, Qi Tang
A continuous-time dynamical system with parameter $\varepsilon$ is nearly-periodic if all its trajectories are periodic with nowhere-vanishing angular frequency as $\varepsilon$ approaches 0. Nearly-periodic maps are discrete-time analogues of nearly-periodic systems, defined as parameter-dependent diffeomorphisms that limit to rotations along a circle action, and they admit formal $U(1)$ symmetries to all orders when the limiting rotation is non-resonant. For Hamiltonian nearly-periodic maps on exact presymplectic manifolds, the formal $U(1)$ symmetry gives rise to a discrete-time adiabatic invariant. In this paper, we construct a novel structure-preserving neural network to approximate nearly-periodic symplectic maps. This neural network architecture, which we call symplectic gyroceptron, ensures that the resulting surrogate map is nearly-periodic and symplectic, and that it gives rise to a discrete-time adiabatic invariant and a long-time stability. This new structure-preserving neural network provides a promising architecture for surrogate modeling of non-dissipative dynamical systems that automatically steps over short timescales without introducing spurious instabilities.
8.3NAMay 20
A Structure-Preserving Decorated Particle Method for the Vlasov-Poisson SystemMandela B. Quashie, J. W. Burby, Andrew J. Christlieb et al.
We revisit the Scovel-Weinstein framework (Scovel & Weinstein, CPAM 1994) for reducing the Vlasov-Poisson system while preserving its Hamiltonian structure. Standard particle-in-cell (PIC) algorithms approximate the distribution function by macro-particles with position and velocity. In contrast, Scovel-Weinstein decorated particles involve additional shape degrees of freedom, while maintaining a finite-dimensional reduction with Hamiltonian structure inherited from the continuum model. Although the original work established this structure three decades ago, its computational potential has remained largely unexplored. We present a practical implementation of the Scovel-Weinstein model and compare it with a standard PIC algorithm. Numerical experiments demonstrate that macro-particles in standard PIC can be replaced by far fewer decorated particles while retaining comparable accuracy. This decorated particle approach offers a new structure-preserving paradigm for kinetic plasma simulation.
3.6CVJun 13, 2025
MambaVSR: Content-Aware Scanning State Space Model for Video Super-ResolutionLinfeng He, Meiqin Liu, Qi Tang et al.
Video super-resolution (VSR) faces critical challenges in effectively modeling non-local dependencies across misaligned frames while preserving computational efficiency. Existing VSR methods typically rely on optical flow strategies or transformer architectures, which struggle with large motion displacements and long video sequences. To address this, we propose MambaVSR, the first state-space model framework for VSR that incorporates an innovative content-aware scanning mechanism. Unlike rigid 1D sequential processing in conventional vision Mamba methods, our MambaVSR enables dynamic spatiotemporal interactions through the Shared Compass Construction (SCC) and the Content-Aware Sequentialization (CAS). Specifically, the SCC module constructs intra-frame semantic connectivity graphs via efficient sparse attention and generates adaptive spatial scanning sequences through spectral clustering. Building upon SCC, the CAS module effectively aligns and aggregates non-local similar content across multiple frames by interleaving temporal features along the learned spatial order. To bridge global dependencies with local details, the Global-Local State Space Block (GLSSB) synergistically integrates window self-attention operations with SSM-based feature propagation, enabling high-frequency detail recovery under global dependency guidance. Extensive experiments validate MambaVSR's superiority, outperforming the Transformer-based method by 0.58 dB PSNR on the REDS dataset with 55% fewer parameters.