Yingda Cheng
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
Yingda Cheng has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Chi-Wang Shu
Division of Applied Mathematics, Brown University, Providence, RI 02912 USA
9 shared publications - Irene M. Gamba
Department of Mathematics and Oden Institute, University of Texas-Austin, Austin, TX 78712 USA
9 shared publications Chi-Wang Shu
6 shared publications- Armando Majorana
University of Catania
5 shared publications - Fengyan Li
Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, USA
5 shared publications - Daniel Appelö
Department of Mathematics Virginia Tech 24061 Blacksburg VA U.S.A
4 shared publications
Latest Publications
- 18 December 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 548
Reduced basis methods for parametric steady-state radiative transfer equation
- 18 December 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 548
Reduced basis methods for parametric steady-state radiative transfer equation
- Open Access
Reduced Basis Methods for Parametric Steady-State Radiative Transfer Equation
The radiative transfer equation (RTE) is a fundamental mathematical model to describe physical phenomena involving the propagation of radiation and its interactions with the host medium. Deterministic methods can produce accurate solutions without any statistical noise, yet often at a price of expensive computational costs originating from the intrinsic high dimensionality of the model. With this work, we present the first systematic investigation of projection-based reduced order models (ROMs) following the reduced basis method (RBM) framework to simulate the parametric steady-state RTE with isotropic scattering and one energy group. Four ROMs are designed, with each defining a nested family of reduced surrogate solvers of different resolution/fidelity. They are based on either a Galerkin or least-squares Petrov-Galerkin projection and utilize either an $L_1$ or residual-based importance/error indicator. Two of the proposed ROMs are certified in the setting when the absorption cross section is positively bounded below uniformly. One technical focus and contribution lie in the proposed implementation strategies under the affine assumption of the parameter dependence of the model. These well-crafted broadly applicable strategies not only ensure the efficiency and accuracy of the offline training stage and the online prediction of reduced surrogate solvers, they also take into account the conditioning of the reduced systems as well as the stagnation-free residual evaluation for numerical robustness. Computational complexities are derived for both the offline training and online prediction stages of the proposed model order reduction strategies, and they are demonstrated numerically along with the accuracy and robustness of the reduced surrogate solvers. Numerically we observe four to six orders of magnitude speedup of our ROMs compared to full order models for some 2D2v examples.Open AccessReduced Basis Methods for Parametric Steady-State Radiative Transfer Equation
The radiative transfer equation (RTE) is a fundamental mathematical model to describe physical phenomena involving the propagation of radiation and its interactions with the host medium. Deterministic methods can produce accurate solutions without any statistical noise, yet often at a price of expensive computational costs originating from the intrinsic high dimensionality of the model. With this work, we present the first systematic investigation of projection-based reduced order models (ROMs) following the reduced basis method (RBM) framework to simulate the parametric steady-state RTE with isotropic scattering and one energy group. Four ROMs are designed, with each defining a nested family of reduced surrogate solvers of different resolution/fidelity. They are based on either a Galerkin or least-squares Petrov-Galerkin projection and utilize either an $L_1$ or residual-based importance/error indicator. Two of the proposed ROMs are certified in the setting when the absorption cross section is positively bounded below uniformly. One technical focus and contribution lie in the proposed implementation strategies under the affine assumption of the parameter dependence of the model. These well-crafted broadly applicable strategies not only ensure the efficiency and accuracy of the offline training stage and the online prediction of reduced surrogate solvers, they also take into account the conditioning of the reduced systems as well as the stagnation-free residual evaluation for numerical robustness. Computational complexities are derived for both the offline training and online prediction stages of the proposed model order reduction strategies, and they are demonstrated numerically along with the accuracy and robustness of the reduced surrogate solvers. Numerically we observe four to six orders of magnitude speedup of our ROMs compared to full order models for some 2D2v examples. - Open Access
Arbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian
In this paper, we develop a framework for designing arbitrary high order low-rank schemes for the Lindblad equation with time-dependent Hamiltonians. Our approach is based on nested Picard iterative integrators (NPI) and results in schemes in Kraus form that are completely positive and trace preserving (CPTP). The schemes are amenable to low rank formulations, making them suitable for problems where the matrix rank of the density matrix is small.
Open AccessArbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian
In this paper, we develop a framework for designing arbitrary high order low-rank schemes for the Lindblad equation with time-dependent Hamiltonians. Our approach is based on nested Picard iterative integrators (NPI) and results in schemes in Kraus form that are completely positive and trace preserving (CPTP). The schemes are amenable to low rank formulations, making them suitable for problems where the matrix rank of the density matrix is small.
- Open Access
A new cross approximation for Tucker tensors and its application in Tucker-Anderson Acceleration
This paper proposes two new algorithms related to the Tucker tensor format. The first method is a new cross approximation for Tucker tensors, which we call Cross$^2$-DEIM. Cross$^2$-DEIM is an iterative method that uses a fiber sampling strategy, sampling $O(r)$ fibers in each mode, where $r$ denotes the target rank. The fibers are selected based on the discrete empirical interpolation method (DEIM). Cross$^2$-DEIM resemblances the Fiber Sampling Tucker Decomposition (FSTD)2 approximation, and has favorable computational scaling compared to existing methods in the literature. We demonstrate good performance of Cross$^2$-DEIM in terms of iteration count and intermediate memory. First we design a fast direct Poisson solver based on Cross$^2$-DEIM and the fast Fourier transform. This solver can be used as a stand alone or as a preconditioner for low-rank solvers for elliptic problems. The second method is a low-rank solver for nonlinear tensor equation in Tucker format by Anderson acceleration (AA), which we call Tucker-AA. Tucker-AA is an extension of low-rank AA (lrAA) proposed in our prior work for low-rank solution to nonlinear matrix equation. We apply Cross$^2$-DEIM with warm-start in Tucker-AA to deal with the nonlinearity in the equation. We apply low-rank operations in AA, and by an appropriate rank truncation strategy, we are able to control the intermediate rank growth. We demonstrated the performance for Tucker-AA for approximate solutions nonlinear PDEs in 3D.Open AccessA new cross approximation for Tucker tensors and its application in Tucker-Anderson Acceleration
This paper proposes two new algorithms related to the Tucker tensor format. The first method is a new cross approximation for Tucker tensors, which we call Cross$^2$-DEIM. Cross$^2$-DEIM is an iterative method that uses a fiber sampling strategy, sampling $O(r)$ fibers in each mode, where $r$ denotes the target rank. The fibers are selected based on the discrete empirical interpolation method (DEIM). Cross$^2$-DEIM resemblances the Fiber Sampling Tucker Decomposition (FSTD)2 approximation, and has favorable computational scaling compared to existing methods in the literature. We demonstrate good performance of Cross$^2$-DEIM in terms of iteration count and intermediate memory. First we design a fast direct Poisson solver based on Cross$^2$-DEIM and the fast Fourier transform. This solver can be used as a stand alone or as a preconditioner for low-rank solvers for elliptic problems. The second method is a low-rank solver for nonlinear tensor equation in Tucker format by Anderson acceleration (AA), which we call Tucker-AA. Tucker-AA is an extension of low-rank AA (lrAA) proposed in our prior work for low-rank solution to nonlinear matrix equation. We apply Cross$^2$-DEIM with warm-start in Tucker-AA to deal with the nonlinearity in the equation. We apply low-rank operations in AA, and by an appropriate rank truncation strategy, we are able to control the intermediate rank growth. We demonstrated the performance for Tucker-AA for approximate solutions nonlinear PDEs in 3D. - 31 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (3) , 1-21
Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations
- 31 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (3) , 1-21
Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations
- Open Access
High-Order Implicit Low-Rank Method with Spectral Deferred Correction for Matrix Differential Equations
In this paper, we develop a low-rank method with high-order temporal accuracy using spectral deferred correction (SDC) to compute linear matrix differential equations. In [1], a low rank numerical method is proposed to correct the modeling error of the basis update and the Galerkin (BUG) method, which is a computational approach for DLRA. This method (merge-BUG/mBUG method) has been demonstrated to be first order convergent for general advection-diffusion problems. In this paper, we explore using SDC to elevate the convergence order of the mBUG method. In SDC, we start by computing a first-order solution by mBUG, and then perform successive updates by computing low-rank solutions to the Picard integral equation. Rather than a straightforward application of SDC with mBUG, we propose two aspects to improve computational efficiency. The first is to reduce the intermediate numerical rank by detailed analysis of dependence of truncation parameter on the correction levels. The second aspect is a careful choice of subspaces in the successive correction to avoid inverting large linear systems (from the K- and L-steps in BUG). We prove that the resulting scheme is high-order accurate for the Lipschitz continuous and bounded dynamical system. We consider numerical rank control in our framework by comparing two low-rank truncation strategies: the hard truncation strategy by truncated singular value decomposition and the soft truncation strategy by soft thresholding. We demonstrate numerically that soft thresholding offers better rank control in particular for higher-order schemes for weakly (or non-)dissipative problems.
Open AccessHigh-Order Implicit Low-Rank Method with Spectral Deferred Correction for Matrix Differential Equations
In this paper, we develop a low-rank method with high-order temporal accuracy using spectral deferred correction (SDC) to compute linear matrix differential equations. In [1], a low rank numerical method is proposed to correct the modeling error of the basis update and the Galerkin (BUG) method, which is a computational approach for DLRA. This method (merge-BUG/mBUG method) has been demonstrated to be first order convergent for general advection-diffusion problems. In this paper, we explore using SDC to elevate the convergence order of the mBUG method. In SDC, we start by computing a first-order solution by mBUG, and then perform successive updates by computing low-rank solutions to the Picard integral equation. Rather than a straightforward application of SDC with mBUG, we propose two aspects to improve computational efficiency. The first is to reduce the intermediate numerical rank by detailed analysis of dependence of truncation parameter on the correction levels. The second aspect is a careful choice of subspaces in the successive correction to avoid inverting large linear systems (from the K- and L-steps in BUG). We prove that the resulting scheme is high-order accurate for the Lipschitz continuous and bounded dynamical system. We consider numerical rank control in our framework by comparing two low-rank truncation strategies: the hard truncation strategy by truncated singular value decomposition and the soft truncation strategy by soft thresholding. We demonstrate numerically that soft thresholding offers better rank control in particular for higher-order schemes for weakly (or non-)dissipative problems.
- Open Access
Preconditioning Low Rank Generalized Minimal Residual Method (GMRES) for Implicit Discretizations of Matrix Differential Equations
This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in computing low rank solutions to matrix equations, e.g. arising from spatial discretization of stiff partial differential equations (PDEs). The low rank GMRES method is a particular class of Krylov subspace method where the iteration is performed on the low rank factors of the solution. Such methods can exploit the low rank property of the solution to save on computational and storage cost. Of critical importance for the efficiency and applicability of the low rank GMRES method is the availability of an effective low rank preconditioner that operates directly on the low rank factors of the solution and that can limit the iteration count and the maximal Krylov rank. The preconditioner we propose here is based on the basis update and Galerkin (BUG) method, resulting from the dynamic low rank approximation. It is a nonlinear preconditioner for the low rank GMRES scheme that naturally operates on the low rank factors. Extensive numerical tests show that this new preconditioner is highly efficient in limiting iteration count and maximal Krylov rank. We show that the preconditioner performs well for general diffusion equations including highly challenging problems, e.g. high contrast, anisotropic equations. Further, it compares favorably with the state of the art exponential sum preconditioner. We also propose a hybrid BUG - exponential sum preconditioner based on alternating between the two preconditioners.
Open AccessPreconditioning Low Rank Generalized Minimal Residual Method (GMRES) for Implicit Discretizations of Matrix Differential Equations
This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in computing low rank solutions to matrix equations, e.g. arising from spatial discretization of stiff partial differential equations (PDEs). The low rank GMRES method is a particular class of Krylov subspace method where the iteration is performed on the low rank factors of the solution. Such methods can exploit the low rank property of the solution to save on computational and storage cost. Of critical importance for the efficiency and applicability of the low rank GMRES method is the availability of an effective low rank preconditioner that operates directly on the low rank factors of the solution and that can limit the iteration count and the maximal Krylov rank. The preconditioner we propose here is based on the basis update and Galerkin (BUG) method, resulting from the dynamic low rank approximation. It is a nonlinear preconditioner for the low rank GMRES scheme that naturally operates on the low rank factors. Extensive numerical tests show that this new preconditioner is highly efficient in limiting iteration count and maximal Krylov rank. We show that the preconditioner performs well for general diffusion equations including highly challenging problems, e.g. high contrast, anisotropic equations. Further, it compares favorably with the state of the art exponential sum preconditioner. We also propose a hybrid BUG - exponential sum preconditioner based on alternating between the two preconditioners.
- 13 October 2023
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 63 (4) , 1-34
Superconvergence and accuracy enhancement of discontinuous Galerkin solutions for Vlasov–Maxwell equations
- 13 October 2023
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 63 (4) , 1-34
Superconvergence and accuracy enhancement of discontinuous Galerkin solutions for Vlasov–Maxwell equations
- 24 July 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 78 (2) , 816-863
Discontinuous Galerkin Methods with Optimal $L^2$ Accuracy for One Dimensional Linear PDEs with High Order Spatial Derivatives- 24 July 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 78 (2) , 816-863
Discontinuous Galerkin Methods with Optimal $L^2$ Accuracy for One Dimensional Linear PDEs with High Order Spatial Derivatives