Shiheng Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shiheng Zhang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Guang Lin
School of Mechanical Engineering, Purdue University, West Lafayette, USA
2 shared publications - Jiahao Zhang
Department of Mathematics, Purdue University, West Lafayette, IN 47906, USA
2 shared publications - Jingwei Hu
Department of Applied Mathematics, University of Washington, Seattle, USA
1 shared publication
Latest Publications
- 22 October 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 464
Low-rank evolutionary deep neural networks via adaptive tangent-space reduction
- 22 October 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 464
Low-rank evolutionary deep neural networks via adaptive tangent-space reduction
- Open Access
- 19 May 2026
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 60 (4) , 1715-1739
A separable and asymptotic-preserving dynamical low-rank method for the Vlasov--Poisson--Fokker--Planck System
We present a dynamical low-rank (DLR) method for the Vlasov--Poisson--Fokker--Planck (VPFP) system. Our main contributions are two-fold: (i) a conservative spatial discretization of the Fokker--Planck operator that factors into velocity-only and space-only components, enabling efficient low-rank projection, and (ii) a time discretization within the DLR framework that properly handles stiff collisions. We propose both first-order and second-order low-rank IMEX schemes. For the first-order scheme, we prove an asymptotic-preserving (AP) property when the field fluctuation is small. Numerical experiments demonstrate accuracy, robustness, and AP property at modest ranks.
- 19 May 2026
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 60 (4) , 1715-1739
Open AccessA separable and asymptotic-preserving dynamical low-rank method for the Vlasov--Poisson--Fokker--Planck System
We present a dynamical low-rank (DLR) method for the Vlasov--Poisson--Fokker--Planck (VPFP) system. Our main contributions are two-fold: (i) a conservative spatial discretization of the Fokker--Planck operator that factors into velocity-only and space-only components, enabling efficient low-rank projection, and (ii) a time discretization within the DLR framework that properly handles stiff collisions. We propose both first-order and second-order low-rank IMEX schemes. For the first-order scheme, we prove an asymptotic-preserving (AP) property when the field fluctuation is small. Numerical experiments demonstrate accuracy, robustness, and AP property at modest ranks.
- Open Access
- 7 April 2026
- Published by Elsevier in SSRN Electronic Journal
Low-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction
Evolutionary deep neural networks (EDNNs) solve time-dependent partial differential equations by evolving the neural-network parameters sequentially in time through a local least-squares problem. Their main computational bottleneck is that each time step requires the solution of a dense linear system whose dimension equals the total number of trainable parameters. We propose a low-rank evolutionary deep neural network (LR-EDNN) method that reduces this cost through adaptive tangent-space projection. At each time step, each layer weight matrix is approximated by a rank-\(r\) truncated singular value decomposition, and the EDNN velocity is restricted to the tangent space of the corresponding fixed-rank matrix manifold. This construction replaces direct bilinear low-rank factor evolution by a linear reduced problem while preserving the sequential-in-time structure of EDNN. We show that the reduced update is the orthogonal projection of the full EDNN update in a Jacobian-induced seminorm, derive a residual decomposition identity, prove uniqueness of the induced discrete solution derivative modulo the Jacobian nullspace, and establish monotonicity with respect to the rank together with recovery of full EDNN in the full-rank limit. We further show that the one-step discrepancy between reduced and full EDNN solution updates is controlled by the tangent-space projection error up to higher-order terms. Numerical experiments on a porous-medium equation with drift, one- and two-dimensional Allen--Cahn equations, and two-dimensional viscous Burgers' equations demonstrate that LR-EDNN substantially reduces computational cost while maintaining the accuracy and qualitative fidelity of the full EDNN solver when the rank is chosen adequately.- 7 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLow-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction
Evolutionary deep neural networks (EDNNs) solve time-dependent partial differential equations by evolving the neural-network parameters sequentially in time through a local least-squares problem. Their main computational bottleneck is that each time step requires the solution of a dense linear system whose dimension equals the total number of trainable parameters. We propose a low-rank evolutionary deep neural network (LR-EDNN) method that reduces this cost through adaptive tangent-space projection. At each time step, each layer weight matrix is approximated by a rank-\(r\) truncated singular value decomposition, and the EDNN velocity is restricted to the tangent space of the corresponding fixed-rank matrix manifold. This construction replaces direct bilinear low-rank factor evolution by a linear reduced problem while preserving the sequential-in-time structure of EDNN. We show that the reduced update is the orthogonal projection of the full EDNN update in a Jacobian-induced seminorm, derive a residual decomposition identity, prove uniqueness of the induced discrete solution derivative modulo the Jacobian nullspace, and establish monotonicity with respect to the rank together with recovery of full EDNN in the full-rank limit. We further show that the one-step discrepancy between reduced and full EDNN solution updates is controlled by the tangent-space projection error up to higher-order terms. Numerical experiments on a porous-medium equation with drift, one- and two-dimensional Allen--Cahn equations, and two-dimensional viscous Burgers' equations demonstrate that LR-EDNN substantially reduces computational cost while maintaining the accuracy and qualitative fidelity of the full EDNN solver when the rank is chosen adequately.