Aiqing Zhu

Aiqing Zhu

Auto-generated profile, based on publicly available information

Aiqing Zhu

Department of Mathematics, National University of Singapore, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2020 in Neural Networks
Verified
Journal Article
Closed access
PJPengzhan Jin
Pengzhan Jin
ZZZhen Zhang
Zhen Zhang
AZAiqing Zhu
Aiqing Zhu
YTYifa Tang
Yifa Tang
George KarniadakisGeorge Karniadakis
George Karniadakis

1 January 2020 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
PJPengzhan Jin
Pengzhan Jin
YTYifa Tang
Yifa Tang
AZAiqing Zhu
Aiqing Zhu
In this work, we prove that any symplectic matrix can be factored into no more than 9 unit triangular symplectic matrices. This structure-preserving factorization of the symplectic matrices immediately reveals two well-known features that (i) the determinant of any symplectic matrix is one and (ii) the matrix symplectic group is path connected, as well as a new feature that (iii) all the unit triangular symplectic matrices form a set of generators of the matrix symplectic group. Furthermore, this factorization yields effective methods for the unconstrained parametrization of the matrix symplectic group as well as its structured subsets. The unconstrained parametrization enables us to apply faster and more efficient unconstrained optimization algorithms to the problems with symplectic constraints under certain circumstances.

15 June 2024 in Journal of Computational Physics
Verified
Journal Article
Closed access
AZAiqing Zhu
Aiqing Zhu
QLQianxiao Li
Qianxiao Li

21 June 2022 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
AZAiqing Zhu
Aiqing Zhu
BZBeibei Zhu
Beibei Zhu
JZJiawei Zhang
Jiawei Zhang
YTYifa Tang
Yifa Tang
JLJian Liu
Jian Liu

4 September 2024 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
AZAiqing Zhu
Aiqing Zhu
SWSidi Wu
Sidi Wu
YTYifa Tang
Yifa Tang
Along with the practical success of the discovery of dynamics using deep learning, the theoretical analysis of this approach has attracted increasing attention. Prior works have established the grid error estimation with auxiliary conditions for the discovery of dynamics using linear multistep methods and deep learning. And we extend the existing error analysis in this work. We first introduce the concept of inverse modified differential equations (IMDE) for linear multistep methods and show that the learned model returns a close approximation of the IMDE. Based on the IMDE, we prove that the error between the discovered system and the target system is bounded by the sum of the LMM discretization error and the learning loss. Furthermore, the learning loss is quantified by combining the approximation and generalization theories of neural networks, and thereby we obtain the priori error estimates. Several numerical experiments are performed to verify the theoretical analysis.

14 October 2024 in SIAM Journal on Applied Dynamical Systems
Verified
Journal Article
Closed access
AZAiqing Zhu
Aiqing Zhu
TBTom Bertalan
Tom Bertalan
BZBeibei Zhu
Beibei Zhu
YTYifa Tang
Yifa Tang
IKIoannis G. Kevrekidis
Ioannis G. Kevrekidis
We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. We also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.