Hongxiu Zhong

Dr. Hongxiu Zhong

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications

1 January 2018 in ETNA - Electronic Transactions on Numerical Analysis
Verified
Journal Article
Open access
PDF file
HZHongxiu Zhong
Hongxiu Zhong
HXHongguo Xu
Hongguo Xu
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.

1 January 2017 in East Asian Journal on Applied Mathematics
Verified
Journal Article
Closed access
PDF file
JWJing Wang
Jing Wang
XGXue-Ping Guo
Xue-Ping Guo
HZHongxiu Zhong
Hongxiu Zhong
Accelerated GPMHSS Method for Solving Complex Systems of Linear Equations - Volume 7 Issue 1 - Jing Wang, Xue-Ping Guo, Hong-Xiu Zhong

16 October 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
HZHongxiu Zhong
Hongxiu Zhong
XGXian-Ming Gu
Xian-Ming Gu
SZShao-Liang Zhang
Shao-Liang Zhang
The block conjugate orthogonal conjugate gradient method (BCOCG) is recognized as a common method to solve complex symmetric linear systems with multiple right-hand sides. However, breakdown always occurs if the right-hand sides are rank deficient. In this paper, based on the orthogonality conditions, we present a breakdown-free BCOCG algorithm with new parameter matrices to handle rank deficiency. To improve the spectral properties of coefficient matrix A, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate A-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms.

7 January 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
HZHongxiu Zhong
Hongxiu Zhong
Zhongming TengZhongming Teng
Zhongming Teng
GCGuoliang Chen
Guoliang Chen
In order to solve all or some eigenvalues lied in a cluster, we propose a weighted block Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem. Error bounds of the approximations to an eigenvalue cluster, as well as their corresponding eigenspace, are established and show the advantages. A practical thick-restart strategy is applied to the block algorithm to eliminate the increasing computational and memory costs, and the numerical instability. Numerical examples illustrate the effectiveness of our new algorithms.

31 March 2025 in IEEE Access
Verified
Journal Article
Open access
WYWendi Yao
Wendi Yao
HZHongxiu Zhong
Hongxiu Zhong
JSJuan Song
Juan Song
QGMRES is an effective approach for solving quaternion linear system. SQGMRES is the simpler version of QGMRES. Similar as restarted GMRES and SGMRES, the residual vectors at the end of each restart cycle in SQGMRES also alternate direction in a cyclic manner. Motivated by LGMRES and SLGMRES, in this paper, we present an acceleration strategy for SQGMRES by disrupting the alternation, and the convergence theory of new algorithm is provided. Finally, we apply new algorithms to color image denoising problems, and their advantages are shown in numerical examples.