Po Yin Fung
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Po Yin Fung has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Sean Hon
Department of Mathematics Hong Kong Baptist University Hong Kong SAR China
5 shared publications - Jiamei Dong
Department of Mathematics Hong Kong Baptist University Kowloon Tong Hong Kong SAR People's Republic China
2 shared publications - Stefano Serra-Capizzano
Department of Science and High Technology, University of Insubria, 22100 Como, Italy
2 shared publications - Xue-Lei Lin
School of Science Harbin Institute of Technology Shenzhen China
2 shared publications - Yuan-Yuan Huang
Department of Mathematics Hong Kong Baptist University Hong Kong SAR China
2 shared publications
Latest Publications
- Open Access
- 29 March 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-24
An Efficient Preconditioner for Evolutionary Partial Differential Equations with $\theta $-Method in Time DiscretizationIn this study, the $$\theta $$ -method is used for discretizing a class of evolutionary partial differential equations. Then, we transform the resultant all-at-once linear system and introduce a novel one-sided preconditioner, which can be fast implemented in a parallel-in-time way. By introducing an auxiliary two-sided preconditioned system, we provide theoretical insights into the relationship between the residuals of the generalized minimal residual (GMRES) method when applied to both one-sided and two-sided preconditioned systems. Moreover, we show that the condition number of the two-sided preconditioned matrix is uniformly bounded by a constant that is independent of the matrix size, which in turn implies that the convergence behavior of the GMRES method for the one-sided preconditioned system is guaranteed. Numerical experiments confirm the efficiency and robustness of the proposed preconditioning approach.- 29 March 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-24
Open AccessAn Efficient Preconditioner for Evolutionary Partial Differential Equations with $\theta $-Method in Time DiscretizationIn this study, the $$\theta $$ -method is used for discretizing a class of evolutionary partial differential equations. Then, we transform the resultant all-at-once linear system and introduce a novel one-sided preconditioner, which can be fast implemented in a parallel-in-time way. By introducing an auxiliary two-sided preconditioned system, we provide theoretical insights into the relationship between the residuals of the generalized minimal residual (GMRES) method when applied to both one-sided and two-sided preconditioned systems. Moreover, we show that the condition number of the two-sided preconditioned matrix is uniformly bounded by a constant that is independent of the matrix size, which in turn implies that the convergence behavior of the GMRES method for the one-sided preconditioned system is guaranteed. Numerical experiments confirm the efficiency and robustness of the proposed preconditioning approach. - Open Access
- 22 January 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 182, 122-138
Block ω-circulant preconditioners for parabolic equations
- 22 January 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 182, 122-138
Open AccessBlock ω-circulant preconditioners for parabolic equations
- Open Access
An efficient preconditioner for evolutionary partial differential equations with $θ$-method in time discretization
In this study, the $θ$-method is used for discretizing a class of evolutionary partial differential equations. Then, we transform the resultant all-at-once linear system and introduce a novel one-sided preconditioner, which can be fast implemented in a parallel-in-time way. By introducing an auxiliary two-sided preconditioned system, we provide theoretical insights into the relationship between the residuals of the generalized minimal residual (GMRES) method when applied to both one-sided and two-sided preconditioned systems. Moreover, we show that the condition number of the two-sided preconditioned matrix is uniformly bounded by a constant that is independent of the matrix size, which in turn implies that the convergence behavior of the GMRES method for the one-sided preconditioned system is guaranteed. Numerical experiments confirm the efficiency and robustness of the proposed preconditioning approach.
Open AccessAn efficient preconditioner for evolutionary partial differential equations with $θ$-method in time discretization
In this study, the $θ$-method is used for discretizing a class of evolutionary partial differential equations. Then, we transform the resultant all-at-once linear system and introduce a novel one-sided preconditioner, which can be fast implemented in a parallel-in-time way. By introducing an auxiliary two-sided preconditioned system, we provide theoretical insights into the relationship between the residuals of the generalized minimal residual (GMRES) method when applied to both one-sided and two-sided preconditioned systems. Moreover, we show that the condition number of the two-sided preconditioned matrix is uniformly bounded by a constant that is independent of the matrix size, which in turn implies that the convergence behavior of the GMRES method for the one-sided preconditioned system is guaranteed. Numerical experiments confirm the efficiency and robustness of the proposed preconditioning approach.
- 14 August 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 95 (4) , 1769-1799
A sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs
- 14 August 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 95 (4) , 1769-1799
A sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs
- Open Access
A sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs
In this work, we propose a simple yet generic preconditioned Krylov subspace method for a large class of nonsymmetric block Toeplitz all-at-once systems arising from discretizing evolutionary partial differential equations. Namely, our main result is to propose two novel symmetric positive definite preconditioners, which can be efficiently diagonalized by the discrete sine transform matrix. More specifically, our approach is to first permute the original linear system to obtain a symmetric one, and subsequently develop desired preconditioners based on the spectral symbol of the modified matrix. Then, we show that the eigenvalues of the preconditioned matrix sequences are clustered around $\pm 1$, which entails rapid convergence when the minimal residual method is devised. Alternatively, when the conjugate gradient method on the normal equations is used, we show that our preconditioner is effective in the sense that the eigenvalues of the preconditioned matrix sequence are clustered around unity. An extension of our proposed preconditioned method is given for high-order backward difference time discretization schemes, which can be applied on a wide range of time-dependent equations. Numerical examples are given, also in the variable-coefficient setting, to demonstrate the effectiveness of our proposed preconditioners, which consistently outperforms an existing block circulant preconditioner discussed in the relevant literature.Open AccessA sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs
In this work, we propose a simple yet generic preconditioned Krylov subspace method for a large class of nonsymmetric block Toeplitz all-at-once systems arising from discretizing evolutionary partial differential equations. Namely, our main result is to propose two novel symmetric positive definite preconditioners, which can be efficiently diagonalized by the discrete sine transform matrix. More specifically, our approach is to first permute the original linear system to obtain a symmetric one, and subsequently develop desired preconditioners based on the spectral symbol of the modified matrix. Then, we show that the eigenvalues of the preconditioned matrix sequences are clustered around $\pm 1$, which entails rapid convergence when the minimal residual method is devised. Alternatively, when the conjugate gradient method on the normal equations is used, we show that our preconditioner is effective in the sense that the eigenvalues of the preconditioned matrix sequence are clustered around unity. An extension of our proposed preconditioned method is given for high-order backward difference time discretization schemes, which can be applied on a wide range of time-dependent equations. Numerical examples are given, also in the variable-coefficient setting, to demonstrate the effectiveness of our proposed preconditioners, which consistently outperforms an existing block circulant preconditioner discussed in the relevant literature.