Xinghui Zhong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xinghui Zhong has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
Yongsheng Chen
7 shared publications- Wei Guo
Department of Mathematics and Statistics, Texas Tech University, Lubbock, USA
6 shared publications - Jue Yan
Department of Mathematics, Iowa State University, Ames, USA
3 shared publications - Qin Li
Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706 USA
3 shared publications Boyang Ye
2 shared publications- Chi-Wang Shu
Division of Applied Mathematics, Brown University, Providence, RI 02912 USA
2 shared publications
Latest Publications
- 14 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , C1244-C1272
Reduced-Order Modeling of Hamiltonian Dynamics Based on Symplectic Neural Networks
We introduce a novel data-driven symplectic reduced-order modeling (ROM) framework for high-dimensional Hamiltonian systems that unifies latent-space discovery and dynamics learning within a single, end-to-end neural architecture. The encoder–decoder is built from Hénon neural networks (HénonNets) and may be augmented with linear G-reflector layers, yielding a structure-preserving symplectic embedding and an associated one-sided symplectic pseudo-inverse between the full and latent phase spaces. Latent dynamics are advanced by a symplectic flow map implemented as a HénonNet. This unified neural architecture ensures exact preservation of the underlying symplectic structure at the reduced-order level, significantly enhancing the fidelity and long-term stability of the resulting ROM. We validate our method through comprehensive numerical experiments on canonical Hamiltonian systems. The results demonstrate the method’s capability for accurate trajectory reconstruction, robust predictive performance beyond the training horizon and strong Hamiltonian preservation. These promising outcomes underscore the effectiveness and potential applicability of our symplectic ROM framework for complex dynamical systems across a broad range of scientific and engineering disciplines. The implementation associated with this work is publicly available at https://github.com/chenyongssss/Symp_NN .
- 14 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , C1244-C1272
Reduced-Order Modeling of Hamiltonian Dynamics Based on Symplectic Neural Networks
We introduce a novel data-driven symplectic reduced-order modeling (ROM) framework for high-dimensional Hamiltonian systems that unifies latent-space discovery and dynamics learning within a single, end-to-end neural architecture. The encoder–decoder is built from Hénon neural networks (HénonNets) and may be augmented with linear G-reflector layers, yielding a structure-preserving symplectic embedding and an associated one-sided symplectic pseudo-inverse between the full and latent phase spaces. Latent dynamics are advanced by a symplectic flow map implemented as a HénonNet. This unified neural architecture ensures exact preservation of the underlying symplectic structure at the reduced-order level, significantly enhancing the fidelity and long-term stability of the resulting ROM. We validate our method through comprehensive numerical experiments on canonical Hamiltonian systems. The results demonstrate the method’s capability for accurate trajectory reconstruction, robust predictive performance beyond the training horizon and strong Hamiltonian preservation. These promising outcomes underscore the effectiveness and potential applicability of our symplectic ROM framework for complex dynamical systems across a broad range of scientific and engineering disciplines. The implementation associated with this work is publicly available at https://github.com/chenyongssss/Symp_NN .
- 15 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 24 (2) , 501-522
Asymptotic-Preserving and Positivity-Preserving Discontinuous Galerkin Method for the Semiconductor Boltzmann Equation in the Diffusive Scaling
In this paper, we develop an asymptotic-preserving and positivity-preserving discontinuous Galerkin (DG) method for solving the semiconductor Boltzmann equation in diffusive scaling. We first formulate the diffusive relaxation system based on the even-odd decomposition method, which allows us to split into one relaxation step and one transport step. We adopt a robust implicit scheme that can be explicitly implemented for the relaxation step that involves the stiffness of the collision term, while the third-order strong-stability-preserving Runge–Kutta method is employed for the transport step. We couple this temporal scheme with the DG method for spatial discretization, which provides additional advantages including high-order accuracy, [Formula: see text]-[Formula: see text] adaptivity, and the ability to handle arbitrary unstructured meshes. A positivity-preserving limiter is further applied to preserve physical properties of numerical solutions. The stability analysis using the even-odd decomposition is conducted for the first time. We demonstrate the accuracy and performance of our proposed scheme through several numerical examples.
- 15 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 24 (2) , 501-522
Asymptotic-Preserving and Positivity-Preserving Discontinuous Galerkin Method for the Semiconductor Boltzmann Equation in the Diffusive Scaling
In this paper, we develop an asymptotic-preserving and positivity-preserving discontinuous Galerkin (DG) method for solving the semiconductor Boltzmann equation in diffusive scaling. We first formulate the diffusive relaxation system based on the even-odd decomposition method, which allows us to split into one relaxation step and one transport step. We adopt a robust implicit scheme that can be explicitly implemented for the relaxation step that involves the stiffness of the collision term, while the third-order strong-stability-preserving Runge–Kutta method is employed for the transport step. We couple this temporal scheme with the DG method for spatial discretization, which provides additional advantages including high-order accuracy, [Formula: see text]-[Formula: see text] adaptivity, and the ability to handle arbitrary unstructured meshes. A positivity-preserving limiter is further applied to preserve physical properties of numerical solutions. The stability analysis using the even-odd decomposition is conducted for the first time. We demonstrate the accuracy and performance of our proposed scheme through several numerical examples.
- 23 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 486
Superconvergence study of the ultra-weak discontinuous Galerkin method for diffusion equations
- 23 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 486
Superconvergence study of the ultra-weak discontinuous Galerkin method for diffusion equations
- Open Access
Physics-informed machine learning for reconstruction of dynamical systems with invariant measure score matching
In this paper, we develop a novel mesh-free framework, termed physics-informed neural networks with invariant measure score matching (PINN-IMSM), for reconstructing dynamical systems from unlabeled point-cloud data that capture the system's invariant measure. The invariant density satisfies the steady-state Fokker-Planck (FP) equation. We reformulate this equation in terms of its score function (the gradient of the log-density), which is estimated directly from data via denoising score matching, thereby bypassing explicit density estimation. This learned score is then embedded into a physics-informed neural network (PINN) to reconstruct the drift velocity field under the resulting score-based FP equation. The mesh-free nature of PINNs allows the framework to scale to higher dimensions, avoiding the curse of dimensionality inherent in mesh-based methods. To address the ill-posedness of high-dimensional inverse problems, we recast the problem as a PDE-constrained optimization that seeks the minimal-energy velocity field. Under suitable conditions, we prove that this problem admits a unique solution that depends continuously on the score function. The constrained formulation is solved using a stochastic augmented Lagrangian method. Numerical experiments on representative dynamical systems, including the Van der Pol oscillator, an active swimmer in an anharmonic trap, and the chaotic Lorenz-63 and Lorenz-96 systems, demonstrate that PINN-IMSM accurately recovers invariant measures and reconstructs faithful dynamical behavior for problems in up to five dimensions.
Open AccessPhysics-informed machine learning for reconstruction of dynamical systems with invariant measure score matching
In this paper, we develop a novel mesh-free framework, termed physics-informed neural networks with invariant measure score matching (PINN-IMSM), for reconstructing dynamical systems from unlabeled point-cloud data that capture the system's invariant measure. The invariant density satisfies the steady-state Fokker-Planck (FP) equation. We reformulate this equation in terms of its score function (the gradient of the log-density), which is estimated directly from data via denoising score matching, thereby bypassing explicit density estimation. This learned score is then embedded into a physics-informed neural network (PINN) to reconstruct the drift velocity field under the resulting score-based FP equation. The mesh-free nature of PINNs allows the framework to scale to higher dimensions, avoiding the curse of dimensionality inherent in mesh-based methods. To address the ill-posedness of high-dimensional inverse problems, we recast the problem as a PDE-constrained optimization that seeks the minimal-energy velocity field. Under suitable conditions, we prove that this problem admits a unique solution that depends continuously on the score function. The constrained formulation is solved using a stochastic augmented Lagrangian method. Numerical experiments on representative dynamical systems, including the Van der Pol oscillator, an active swimmer in an anharmonic trap, and the chaotic Lorenz-63 and Lorenz-96 systems, demonstrate that PINN-IMSM accurately recovers invariant measures and reconstructs faithful dynamical behavior for problems in up to five dimensions.
- 5 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 44
Stochastic Galerkin Methods for Radiative Transfer Equations with Uncertain and Highly Oscillatory Scattering Coefficients
- 5 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 44
Stochastic Galerkin Methods for Radiative Transfer Equations with Uncertain and Highly Oscillatory Scattering Coefficients
- Open Access
Asymptotic-preserving and positivity-preserving discontinuous Galerkin method for the semiconductor Boltzmann equation in the diffusive scaling
In this paper, we develop an asymptotic-preserving and positivity-preserving discontinuous Galerkin (DG) method for solving the semiconductor Boltzmann equation in the diffusive scaling. We first formulate the diffusive relaxation system based on the even-odd decomposition method, which allows us to split into one relaxation step and one transport step. We adopt a robust implicit scheme that can be explicitly implemented for the relaxation step that involves the stiffness of the collision term, while the third-order strong-stability-preserving Runge-Kutta method is employed for the transport step. We couple this temporal scheme with the DG method for spatial discretization, which provides additional advantages including high-order accuracy, $h$-$p$ adaptivity, and the ability to handle arbitrary unstructured meshes. A positivity-preserving limiter is further applied to preserve physical properties of numerical solutions. The stability analysis using the even-odd decomposition is conducted for the first time. We demonstrate the accuracy and performance of our proposed scheme through several numerical examples.Open AccessAsymptotic-preserving and positivity-preserving discontinuous Galerkin method for the semiconductor Boltzmann equation in the diffusive scaling
In this paper, we develop an asymptotic-preserving and positivity-preserving discontinuous Galerkin (DG) method for solving the semiconductor Boltzmann equation in the diffusive scaling. We first formulate the diffusive relaxation system based on the even-odd decomposition method, which allows us to split into one relaxation step and one transport step. We adopt a robust implicit scheme that can be explicitly implemented for the relaxation step that involves the stiffness of the collision term, while the third-order strong-stability-preserving Runge-Kutta method is employed for the transport step. We couple this temporal scheme with the DG method for spatial discretization, which provides additional advantages including high-order accuracy, $h$-$p$ adaptivity, and the ability to handle arbitrary unstructured meshes. A positivity-preserving limiter is further applied to preserve physical properties of numerical solutions. The stability analysis using the even-odd decomposition is conducted for the first time. We demonstrate the accuracy and performance of our proposed scheme through several numerical examples. - 20 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (3) , 1-30
Numerical Solutions of Stochastic PDEs Driven by Ornstein–Uhlenbeck Noise
- 20 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (3) , 1-30
Numerical Solutions of Stochastic PDEs Driven by Ornstein–Uhlenbeck Noise
- 16 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 22 (4) , 1421-1448
A Multifidelity Machine Learning Based Semi-Lagrangian Finite Volume Scheme for Linear Transport Equations and the Nonlinear Vlasov–Poisson System
Machine-learning (ML) based discretization has been developed to simulate complex partial differential equations (PDEs) with tremendous success across various fields. These learned PDE solvers can effectively resolve the underlying solution structures of interest and achieve a level of accuracy which often requires an order-of-magnitude finer grid for a conventional numerical method using polynomial-based approximations. In a previous work [ 13 ], we introduced a learned finite volume discretization that further incorporates the semi-Lagrangian (SL) mechanism, enabling larger CFL numbers for stability. However, the efficiency and effectiveness of such a methodology heavily rely on the availability of abundant high-resolution training data, which can be prohibitively expensive to obtain. To address this challenge, in this paper, we propose a novel multifidelity ML-based SL method for transport equations. This method leverages a combination of a small amount of high-fidelity data and sufficient but cheaper low-fidelity data. The approach is designed based on a composite convolutional neural network architecture that explores the inherent correlation between high-fidelity and low-fidelity data. The proposed method demonstrates the capability to achieve a reasonable level of accuracy, particularly in scenarios where a single-fidelity model fails to generalize effectively. We further extend the method to the nonlinear Vlasov–Poisson system by employing high-order Runge–Kutta exponential integrators. A collection of numerical tests are provided to validate the efficiency and accuracy of the proposed method.
- 16 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 22 (4) , 1421-1448
A Multifidelity Machine Learning Based Semi-Lagrangian Finite Volume Scheme for Linear Transport Equations and the Nonlinear Vlasov–Poisson System
Machine-learning (ML) based discretization has been developed to simulate complex partial differential equations (PDEs) with tremendous success across various fields. These learned PDE solvers can effectively resolve the underlying solution structures of interest and achieve a level of accuracy which often requires an order-of-magnitude finer grid for a conventional numerical method using polynomial-based approximations. In a previous work [ 13 ], we introduced a learned finite volume discretization that further incorporates the semi-Lagrangian (SL) mechanism, enabling larger CFL numbers for stability. However, the efficiency and effectiveness of such a methodology heavily rely on the availability of abundant high-resolution training data, which can be prohibitively expensive to obtain. To address this challenge, in this paper, we propose a novel multifidelity ML-based SL method for transport equations. This method leverages a combination of a small amount of high-fidelity data and sufficient but cheaper low-fidelity data. The approach is designed based on a composite convolutional neural network architecture that explores the inherent correlation between high-fidelity and low-fidelity data. The proposed method demonstrates the capability to achieve a reasonable level of accuracy, particularly in scenarios where a single-fidelity model fails to generalize effectively. We further extend the method to the nonlinear Vlasov–Poisson system by employing high-order Runge–Kutta exponential integrators. A collection of numerical tests are provided to validate the efficiency and accuracy of the proposed method.
- 17 August 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 101 (1) , 1-32
Direct Discontinuous Galerkin Method with Interface Correction for the Keller-Segel Chemotaxis Model
- 17 August 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 101 (1) , 1-32
Direct Discontinuous Galerkin Method with Interface Correction for the Keller-Segel Chemotaxis Model