Cheng Zuo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cheng Zuo has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Yuwen Li
School of Mathematical Sciences, Zhejiang University, Hangzhou, Zhejiang, 310058 China
2 shared publicationsLudmil Zikatanov
Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 USA
1 shared publication- Ludmil Zikatanov
Department of Mathematics, Pennsylvania State University, University Park, PA 16802 USA
1 shared publication
Latest Publications
- 25 April 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 63 (2) , 976-999
Reduced Krylov Basis Methods for Parametric Partial Differential Equations
This work is on a user-friendly reduced basis method for the solution of families of parametric partial differential equations by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and biconjugate gradient method. The proposed methods use a preconditioned Krylov subspace method for a high-fidelity discretization of one parameter instance to generate orthogonal basis vectors of the reduced basis subspace. Then large-scale discrete parameter-dependent problems are approximately solved in the low-dimensional Krylov subspace. We prove convergence estimates for the proposed method when the differential operator depends on two parameter coefficients and the preconditioner is the inverse of the operator at a fixed parameter. As is shown in numerical experiments, only a small number of Krylov subspace iterations are needed to simultaneously generate approximate solutions of a family of high-fidelity and large-scale parametrized systems in the reduced basis subspace. This reduces the computational cost by orders of magnitude, because (1) to construct the reduced basis vectors, we only solve one large-scale problem in the high-fidelity level; and (2) the family of problems restricted to the reduced basis subspace have much smaller sizes.
- 25 April 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 63 (2) , 976-999
Reduced Krylov Basis Methods for Parametric Partial Differential Equations
This work is on a user-friendly reduced basis method for the solution of families of parametric partial differential equations by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and biconjugate gradient method. The proposed methods use a preconditioned Krylov subspace method for a high-fidelity discretization of one parameter instance to generate orthogonal basis vectors of the reduced basis subspace. Then large-scale discrete parameter-dependent problems are approximately solved in the low-dimensional Krylov subspace. We prove convergence estimates for the proposed method when the differential operator depends on two parameter coefficients and the preconditioner is the inverse of the operator at a fixed parameter. As is shown in numerical experiments, only a small number of Krylov subspace iterations are needed to simultaneously generate approximate solutions of a family of high-fidelity and large-scale parametrized systems in the reduced basis subspace. This reduces the computational cost by orders of magnitude, because (1) to construct the reduced basis vectors, we only solve one large-scale problem in the high-fidelity level; and (2) the family of problems restricted to the reduced basis subspace have much smaller sizes.
- 18 April 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (5) , S68-S87
A Reduced Conjugate Gradient Basis Method for Fractional Diffusion
This work is on a fast and accurate reduced basis method for solving discretized fractional elliptic partial differential equations (PDEs) of the form [Formula: see text] by rational approximation. A direct computation of the action of such an approximation would require solving multiple (20[Formula: see text]30) large-scale sparse linear systems. Our method constructs the reduced basis using the first few directions obtained from the preconditioned conjugate gradient method applied to one of the linear systems. As shown in the theory and experiments, only a small number of directions (5[Formula: see text]10) are needed to approximately solve all large-scale systems on the reduced basis subspace. This reduces the computational cost dramatically because: (1) We only use one of the large-scale problems to construct the basis; and (2) all large-scale problems restricted to the subspace have much smaller sizes. We test our algorithms for fractional PDEs on a 3d Euclidean domain, a 2d surface, and random combinatorial graphs. We also use a novel approach to construct the rational approximation for the fractional power function by the orthogonal greedy algorithm (OGA). Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/yuwenli925/RCGBM and in the supplementary materials ( RCGBM-main.zip [19.8KB]). [Formula: see text]
- 18 April 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (5) , S68-S87
A Reduced Conjugate Gradient Basis Method for Fractional Diffusion
This work is on a fast and accurate reduced basis method for solving discretized fractional elliptic partial differential equations (PDEs) of the form [Formula: see text] by rational approximation. A direct computation of the action of such an approximation would require solving multiple (20[Formula: see text]30) large-scale sparse linear systems. Our method constructs the reduced basis using the first few directions obtained from the preconditioned conjugate gradient method applied to one of the linear systems. As shown in the theory and experiments, only a small number of directions (5[Formula: see text]10) are needed to approximately solve all large-scale systems on the reduced basis subspace. This reduces the computational cost dramatically because: (1) We only use one of the large-scale problems to construct the basis; and (2) all large-scale problems restricted to the subspace have much smaller sizes. We test our algorithms for fractional PDEs on a 3d Euclidean domain, a 2d surface, and random combinatorial graphs. We also use a novel approach to construct the rational approximation for the fractional power function by the orthogonal greedy algorithm (OGA). Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/yuwenli925/RCGBM and in the supplementary materials ( RCGBM-main.zip [19.8KB]). [Formula: see text]