Tongxiang Gu

Tongxiang Gu

Auto-generated profile, based on publicly available information

Tongxiang Gu

Institute of Applied Physics and Computational Mathematics, Beijing, Beijing, CHINA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
10 March 2025 in Computer Physics Communications
Verified
Journal Article
Closed access
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
XXXiaowen Xu
Xiaowen Xu
HAHengbin An
Hengbin An
YYYanzhong Yao
Yanzhong Yao

1 June 2007 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Yong ZhangYong Zhang
Yong Zhang
THTing-Zhu Huang
Ting-Zhu Huang
XLXingping Liu
Xingping Liu
TGTong-Xiang Gu
Tong-Xiang Gu

27 February 2023
Verified
Conference Paper
Open access
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
SGStef Graillat
Stef Graillat
XXXiaowen Xu
Xiaowen Xu
JMjing meng
jing meng
Krylov subspace algorithms are important methods for solving linear systems. In order to efficiently solve large-scale linear systems, parallelism techniques are often applied. However, parallelism often enlarge the non-associativity of floating-point operations, which can lead to non-reproducibility of the computations. This paper compares the performance of the parallel preconditioned BiCGSTAB algorithm implemented with two different libraries (ExBLAS and ReproBLAS) that can ensure the reproducibility of computations. To address the effect of the compiler, we explicitly utilize the FMA instructions. Finally, numerical experiments show that based on two BLAS implementations, the BiCGSTAB algorithms are reproducible. By contrast, the BiCGSTAB algorithm based on ExBLAS is more accurate but more time-consuming than the one based on ReproBLAS.