Sean Hon
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
Research Subjects
Sean Hon has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Xue-Lei Lin
School of Science Harbin Institute of Technology Shenzhen China
10 shared publications - Congcong Li
Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong SAR
6 shared publications - Stefano Serra-Capizzano
Department of Science and High Technology, University of Insubria, 22100 Como, Italy
6 shared publications - Po Yin Fung
Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong SAR
5 shared publications - Siu-Long Lei
Department of Mathematics University of Macau Macao SAR China
5 shared publications - Jiamei Dong
Department of Mathematics Hong Kong Baptist University Kowloon Tong Hong Kong SAR People's Republic China
4 shared publications
Latest Publications
- 22 July 2026
- Published by Wiley in Studies in Applied Mathematics
- Vol. 157 (1) , e70271
Optimal Preconditioning Techniques for Finite Volume Approximation of Three‐Dimensional Conservative Space‐Fractional Diffusion Equations
A Crank–Nicolson finite volume approximation for three‐dimensional conservative space‐fractional diffusion equation results in large and dense three‐level Toeplitz discrete linear systems. Preconditioned Krylov subspace methods with sine transform–based preconditioners are developed to solve these systems, including the preconditioned conjugate gradient (PCG) method for the symmetric case and the preconditioned generalized minimal residual (PGMRES) method for the nonsymmetric case. Moreover, we provide detailed analysis of the convergence of these Krylov subspace methods. Specifically, for the symmetric case, we prove the spectra of the preconditioned matrices are uniformly bounded in the open interval , which results in a linear convergence rate of the PCG method. For the nonsymmetric case, we demonstrate that the PGMRES method also achieves a linear convergence rate independent of discretization stepsizes from the residual point of view. These results imply that the iteration counts of the PCG and PGMRES methods are uniformly bounded and independent of the matrix sizes. Numerical experiments in both symmetric and nonsymmetric cases in two‐ and three‐dimensions are conducted to confirm the optimal performance of the proposed preconditioned Krylov subspace methods.
- 22 July 2026
- Published by Wiley in Studies in Applied Mathematics
- Vol. 157 (1) , e70271
Optimal Preconditioning Techniques for Finite Volume Approximation of Three‐Dimensional Conservative Space‐Fractional Diffusion Equations
A Crank–Nicolson finite volume approximation for three‐dimensional conservative space‐fractional diffusion equation results in large and dense three‐level Toeplitz discrete linear systems. Preconditioned Krylov subspace methods with sine transform–based preconditioners are developed to solve these systems, including the preconditioned conjugate gradient (PCG) method for the symmetric case and the preconditioned generalized minimal residual (PGMRES) method for the nonsymmetric case. Moreover, we provide detailed analysis of the convergence of these Krylov subspace methods. Specifically, for the symmetric case, we prove the spectra of the preconditioned matrices are uniformly bounded in the open interval , which results in a linear convergence rate of the PCG method. For the nonsymmetric case, we demonstrate that the PGMRES method also achieves a linear convergence rate independent of discretization stepsizes from the residual point of view. These results imply that the iteration counts of the PCG and PGMRES methods are uniformly bounded and independent of the matrix sizes. Numerical experiments in both symmetric and nonsymmetric cases in two‐ and three‐dimensions are conducted to confirm the optimal performance of the proposed preconditioned Krylov subspace methods.
- 13 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (1) , 214-243
An Optimal Diagonalization-Based Preconditioner for Parabolic Optimal Control Problems
- 13 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (1) , 214-243
An Optimal Diagonalization-Based Preconditioner for Parabolic Optimal Control Problems
- 3 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 37
A Matching Schur Complement Preconditioning Technique for a Discrete Time Fractional Diffusion Inverse Source Problem
- 3 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 37
A Matching Schur Complement Preconditioning Technique for a Discrete Time Fractional Diffusion Inverse Source Problem
- Open Access
- 11 November 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (6)
An Optimal Preconditioned MINRES Method for Symmetrized Multilevel Block Toeplitz Systems With Applications
In this work, we propose a novel preconditioned minimal residual method for a class of real, nonsymmetric multilevel block Toeplitz systems, which generalizes an ideal preconditioner established in [J. Pestana. Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices. SIAM Journal on Matrix Analysis and Applications, 40(3):870–887, 2019]. First, we symmetrize a certain real, nonsymmetric multilevel block Toeplitz system with symmetric blocks using a simple permutation matrix. We then show that its Hermitian part serves as an ideal preconditioner. Subsequently, we develop a novel preconditioning strategy for the aforementioned systems, with applications to solving nonlocal evolutionary fractional diffusion equations. Specifically, we first transform the nonsymmetric block Toeplitz all‐at‐once system arising from the equations into a symmetric block Hankel system via a symmetrization technique. Then, we propose a symmetric positive definite block Tau preconditioner for the symmetrized system, which can be implemented efficiently using the discrete sine transform. We prove that mesh‐size‐independent convergence can be achieved using the preconditioned minimal residual method. Theoretically, we show that the eigenvalues of the preconditioned matrices under consideration are bounded within disjoint intervals containing , without outliers. The effectiveness of the proposed preconditioning strategy, in terms of iterations and CPU times, is validated through numerical examples.
- 11 November 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (6)
Open AccessAn Optimal Preconditioned MINRES Method for Symmetrized Multilevel Block Toeplitz Systems With Applications
In this work, we propose a novel preconditioned minimal residual method for a class of real, nonsymmetric multilevel block Toeplitz systems, which generalizes an ideal preconditioner established in [J. Pestana. Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices. SIAM Journal on Matrix Analysis and Applications, 40(3):870–887, 2019]. First, we symmetrize a certain real, nonsymmetric multilevel block Toeplitz system with symmetric blocks using a simple permutation matrix. We then show that its Hermitian part serves as an ideal preconditioner. Subsequently, we develop a novel preconditioning strategy for the aforementioned systems, with applications to solving nonlocal evolutionary fractional diffusion equations. Specifically, we first transform the nonsymmetric block Toeplitz all‐at‐once system arising from the equations into a symmetric block Hankel system via a symmetrization technique. Then, we propose a symmetric positive definite block Tau preconditioner for the symmetrized system, which can be implemented efficiently using the discrete sine transform. We prove that mesh‐size‐independent convergence can be achieved using the preconditioned minimal residual method. Theoretically, we show that the eigenvalues of the preconditioned matrices under consideration are bounded within disjoint intervals containing , without outliers. The effectiveness of the proposed preconditioning strategy, in terms of iterations and CPU times, is validated through numerical examples.
- 22 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (4) , 2331-2359
Symbol-Based Multilevel Block \(\tau\) Preconditioners for Multilevel Block Toeplitz Systems: GLT-Based Analysis and ApplicationsIn recent years, there has been a renewed interest in preconditioning for multilevel Toeplitz systems, a research field that has been extensively explored over the past several decades. This work introduces novel preconditioning strategies using multilevel [Formula: see text] matrices for both symmetric and nonsymmetric multilevel Toeplitz systems. Our proposals constitute a general framework, as they are constructed solely based on the generating function of the multilevel Toeplitz coefficient matrix, when it can be defined. We begin with nonsymmetric systems, where we employ a symmetrization technique by permuting the coefficient matrix to produce a real symmetric multilevel Hankel structure. We propose a multilevel [Formula: see text] preconditioner tailored to the symmetrized system and prove that the eigenvalues of the preconditioned matrix sequence cluster at [Formula: see text], leading to rapid convergence when using the preconditioned minimal residual method. The high effectiveness of this approach is demonstrated through its application in solving space fractional diffusion equations. Next, for symmetric systems we introduce another multilevel [Formula: see text] preconditioner and show that the preconditioned conjugate gradient method can achieve an optimal convergence rate, namely a rate that is independent of the matrix size, when employed for a class of ill-conditioned multilevel Toeplitz systems. Numerical examples are provided to critically assess the effectiveness of our proposed preconditioners compared to several leading existing preconditioned solvers, highlighting their superior performance. (This article has been updated.)
- 22 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (4) , 2331-2359
Symbol-Based Multilevel Block \(\tau\) Preconditioners for Multilevel Block Toeplitz Systems: GLT-Based Analysis and ApplicationsIn recent years, there has been a renewed interest in preconditioning for multilevel Toeplitz systems, a research field that has been extensively explored over the past several decades. This work introduces novel preconditioning strategies using multilevel [Formula: see text] matrices for both symmetric and nonsymmetric multilevel Toeplitz systems. Our proposals constitute a general framework, as they are constructed solely based on the generating function of the multilevel Toeplitz coefficient matrix, when it can be defined. We begin with nonsymmetric systems, where we employ a symmetrization technique by permuting the coefficient matrix to produce a real symmetric multilevel Hankel structure. We propose a multilevel [Formula: see text] preconditioner tailored to the symmetrized system and prove that the eigenvalues of the preconditioned matrix sequence cluster at [Formula: see text], leading to rapid convergence when using the preconditioned minimal residual method. The high effectiveness of this approach is demonstrated through its application in solving space fractional diffusion equations. Next, for symmetric systems we introduce another multilevel [Formula: see text] preconditioner and show that the preconditioned conjugate gradient method can achieve an optimal convergence rate, namely a rate that is independent of the matrix size, when employed for a class of ill-conditioned multilevel Toeplitz systems. Numerical examples are provided to critically assess the effectiveness of our proposed preconditioners compared to several leading existing preconditioned solvers, highlighting their superior performance. (This article has been updated.)
- 11 June 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (3)
Optimal Preconditioners for Nonsymmetric Multilevel Toeplitz Systems With Application to Solving Nonlocal Evolutionary Partial Differential Equations
Preconditioning for multilevel Toeplitz systems has long been a focal point of research in numerical linear algebra. In this work, we develop a novel preconditioning method for a class of nonsymmetric multilevel Toeplitz systems, which includes the all‐at‐once systems that arise from evolutionary partial differential equations. These systems have recently garnered considerable attention in the literature. To further illustrate our proposed preconditioning strategy, we specifically consider the application of solving a wide range of nonlocal, time‐dependent partial differential equations in a parallel‐in‐time manner. For these equations, we propose a symmetric positive definite multilevel Tau preconditioner that is not only efficient to implement but can also be adapted as an optimal preconditioner. In this context, the proposed preconditioner is optimal in the sense that it enables mesh‐independent convergence when using the preconditioned generalized minimal residual method. Numerical examples are provided to critically analyze the results and underscore the effectiveness of our preconditioning strategy.
- 11 June 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (3)
Optimal Preconditioners for Nonsymmetric Multilevel Toeplitz Systems With Application to Solving Nonlocal Evolutionary Partial Differential Equations
Preconditioning for multilevel Toeplitz systems has long been a focal point of research in numerical linear algebra. In this work, we develop a novel preconditioning method for a class of nonsymmetric multilevel Toeplitz systems, which includes the all‐at‐once systems that arise from evolutionary partial differential equations. These systems have recently garnered considerable attention in the literature. To further illustrate our proposed preconditioning strategy, we specifically consider the application of solving a wide range of nonlocal, time‐dependent partial differential equations in a parallel‐in‐time manner. For these equations, we propose a symmetric positive definite multilevel Tau preconditioner that is not only efficient to implement but can also be adapted as an optimal preconditioner. In this context, the proposed preconditioner is optimal in the sense that it enables mesh‐independent convergence when using the preconditioned generalized minimal residual method. Numerical examples are provided to critically analyze the results and underscore the effectiveness of our preconditioning strategy.
- Open Access
- 1 April 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-18
Absolute-Value Based Preconditioner for Complex-Shifted Laplacian Systems
The complex-shifted Laplacian systems arising in a wide range of applications. In this work, we propose an absolute-value based preconditioner for solving the complex-shifted Laplacian system. In our approach, the complex-shifted Laplacian system is equivalently rewritten as a $$2\times 2$$ block real linear system. With the Toeplitz structure of uniform-grid discretization of the constant-coefficient Laplacian operator, the absolute value of the block real matrix is fast invertible by means of fast sine transforms. For more general coefficient function, we then average the coefficient function and take the absolute value of the averaged matrix as our preconditioner. With assumptions on the complex shift, we theoretically prove that the eigenvalues of the preconditioned matrix in absolute value are upper and lower bounded by constants independent on the matrix size, indicating a matrix-size independent linear convergence rate of the MINRES solver. Interestingly, numerical results show that the proposed preconditioner is still efficient even if the assumptions on the complex shift are not met. The fast invertibility of the proposed preconditioner and the robust convergence rate of the preconditioned MINRES solver lead to a linearithmic (nearly optimal) complexity of the proposed solver. The proposed preconditioner is compared with several state-of-the-art preconditioners via several numerical examples to demonstrate the efficiency of the proposed preconditioner.- 1 April 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-18
Open AccessAbsolute-Value Based Preconditioner for Complex-Shifted Laplacian Systems
The complex-shifted Laplacian systems arising in a wide range of applications. In this work, we propose an absolute-value based preconditioner for solving the complex-shifted Laplacian system. In our approach, the complex-shifted Laplacian system is equivalently rewritten as a $$2\times 2$$ block real linear system. With the Toeplitz structure of uniform-grid discretization of the constant-coefficient Laplacian operator, the absolute value of the block real matrix is fast invertible by means of fast sine transforms. For more general coefficient function, we then average the coefficient function and take the absolute value of the averaged matrix as our preconditioner. With assumptions on the complex shift, we theoretically prove that the eigenvalues of the preconditioned matrix in absolute value are upper and lower bounded by constants independent on the matrix size, indicating a matrix-size independent linear convergence rate of the MINRES solver. Interestingly, numerical results show that the proposed preconditioner is still efficient even if the assumptions on the complex shift are not met. The fast invertibility of the proposed preconditioner and the robust convergence rate of the preconditioned MINRES solver lead to a linearithmic (nearly optimal) complexity of the proposed solver. The proposed preconditioner is compared with several state-of-the-art preconditioners via several numerical examples to demonstrate the efficiency of the proposed preconditioner.