Li-Tao Zhang
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
Li-Tao Zhang has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
Tong-Xiang Gu
Laboratory of Computationary Physics
5 shared publications- Jian-Feng Zhao
College of Information Engineering
4 shared publications - Ting-Zhu Huang
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications Xian-Yu Zuo
Henan University
3 shared publications- Xianyu Zuo
Henan University, Kaifeng, China
3 shared publications Xiaojing Zhang
3 shared publications
Latest Publications
- 1 January 2027
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 17 (2) , 731-743
PARAMETERIZED REGULARIZED DPSS PRECONDITIONERS FOR NON-HERMITIAN SADDLE POINT PROBLEMS
Recently, Cao [Applied Mathematics Letters, 2018, 84: 96-102] presented a regularized deteriorated positive and skew-Hermitian splitting (RDPSS) iteration method for solving the large sparse non-Hermitian saddle point problems and studied the convergence of the corresponding RDPSS stationary iteration method. In this paper, based on the RDPSS iteration method, we construct a parameterized RDPSS (PRDPSS) iteration method for solving the large sparse non-Hermitian saddle point problems and theoretically prove that presented method converges to the unique solution of the system of linear equations unconditionally. Finally, one example is provided to confirm the effectiveness.
- 1 January 2027
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 17 (2) , 731-743
PARAMETERIZED REGULARIZED DPSS PRECONDITIONERS FOR NON-HERMITIAN SADDLE POINT PROBLEMS
Recently, Cao [Applied Mathematics Letters, 2018, 84: 96-102] presented a regularized deteriorated positive and skew-Hermitian splitting (RDPSS) iteration method for solving the large sparse non-Hermitian saddle point problems and studied the convergence of the corresponding RDPSS stationary iteration method. In this paper, based on the RDPSS iteration method, we construct a parameterized RDPSS (PRDPSS) iteration method for solving the large sparse non-Hermitian saddle point problems and theoretically prove that presented method converges to the unique solution of the system of linear equations unconditionally. Finally, one example is provided to confirm the effectiveness.
- Retraction
- 30 March 2026
- Published by Springer Nature in Wireless Networks
- Vol. 32 (5) , 3411
Retraction Note: Multi-core parallel BRSMF method for 2D3T radiation diffusion equations
- 30 March 2026
- Published by Springer Nature in Wireless Networks
- Vol. 32 (5) , 3411
RetractionRetraction Note: Multi-core parallel BRSMF method for 2D3T radiation diffusion equations
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
A new modified alternating preconditioner for nonsymmetric saddle point problems
The performance of the preconditioned generalized minimal residual (GMRES) method depends strongly on the choice of preconditioner. In this paper, a new modified alternating (NMALT) preconditioner with a parameter is constructed, the convergence of the corresponding iterative method is studied theoretically, and the eigenvalue distribution of the preconditioned matrix is estimated. Furthermore, a practical parameter is calculated. Finally, the efficiency of the preconditioner is illustrated by the numerical experiments.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
A new modified alternating preconditioner for nonsymmetric saddle point problems
The performance of the preconditioned generalized minimal residual (GMRES) method depends strongly on the choice of preconditioner. In this paper, a new modified alternating (NMALT) preconditioner with a parameter is constructed, the convergence of the corresponding iterative method is studied theoretically, and the eigenvalue distribution of the preconditioned matrix is estimated. Furthermore, a practical parameter is calculated. Finally, the efficiency of the preconditioner is illustrated by the numerical experiments.
- 18 November 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 8 (1) , 61-79
Optimizing Standard Convolution for Diverse Precision on DCU
- 18 November 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 8 (1) , 61-79
Optimizing Standard Convolution for Diverse Precision on DCU
- 22 February 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 7 (2) , 142-154
Optimizing 2D convolution for DCUs
- 22 February 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 7 (2) , 142-154
Optimizing 2D convolution for DCUs
- 1 January 2025
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 15 (5) , 2747-2760
A NEW PARAMETERIZED MATRIX SPLITTING PRECONDITIONER FOR THE SADDLE POINT PROBLEMS
Recently, Zheng and Lu [International Journal of Computer Mathematics, 96(1): 1-17, DOI: 10.1080/00207160.2017.1420179] constructed a parameterized matrix splitting (PMS) preconditioner for the large sparse saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the parameterized matrix splitting, we generalize the PMS algorithms and further present the new parameterized matrix splitting (NPMS) preconditioner for the saddle point problems. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the NPMS preconditioned saddle point matrices. Finally, one example is provided to confirm the effectiveness.
- 1 January 2025
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 15 (5) , 2747-2760
A NEW PARAMETERIZED MATRIX SPLITTING PRECONDITIONER FOR THE SADDLE POINT PROBLEMS
Recently, Zheng and Lu [International Journal of Computer Mathematics, 96(1): 1-17, DOI: 10.1080/00207160.2017.1420179] constructed a parameterized matrix splitting (PMS) preconditioner for the large sparse saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the parameterized matrix splitting, we generalize the PMS algorithms and further present the new parameterized matrix splitting (NPMS) preconditioner for the saddle point problems. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the NPMS preconditioned saddle point matrices. Finally, one example is provided to confirm the effectiveness.
- 1 January 2025
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 15 (3) , 1520-1535
THE MODIFIED DOUBLE SHIFT-SPLITTING PRECONDITIONER FOR NONSYMMETRIC GENERALIZED SADDLE POINT PROBLEMS FROM THE TIME-HARMONIC MAXWELL EQUATIONS
Recently, Fan, Zhu and Zheng [Computational and Applied Mathematics, 37(3), 3256-3266] proposed a generalized double shift-splitting (GDSS) preconditioner induced by a new matrix splitting method for nonsymmetric generalized saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized double shift-splitting (GDSS) preconditioner, we generalize the GDSS algorithms and further present the modified double shift-splitting (MDSS) preconditioner for nonsymmetric generalized saddle point problems having a nonsymmetric positive definite (1,1)-block and a positive definite (2,2)-block. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the MDSS preconditioned saddle point matrices. In final, one example is provided to confirm the effectiveness.
- 1 January 2025
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 15 (3) , 1520-1535
THE MODIFIED DOUBLE SHIFT-SPLITTING PRECONDITIONER FOR NONSYMMETRIC GENERALIZED SADDLE POINT PROBLEMS FROM THE TIME-HARMONIC MAXWELL EQUATIONS
Recently, Fan, Zhu and Zheng [Computational and Applied Mathematics, 37(3), 3256-3266] proposed a generalized double shift-splitting (GDSS) preconditioner induced by a new matrix splitting method for nonsymmetric generalized saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized double shift-splitting (GDSS) preconditioner, we generalize the GDSS algorithms and further present the modified double shift-splitting (MDSS) preconditioner for nonsymmetric generalized saddle point problems having a nonsymmetric positive definite (1,1)-block and a positive definite (2,2)-block. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the MDSS preconditioned saddle point matrices. In final, one example is provided to confirm the effectiveness.
- 1 January 2024
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 14 (5) , 2877-2889
A PARAMETERIZED SHIFT-SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
Recently, Chen and Ma [Journal of Computational and Applied Mathematics, 344(2018): 691–700] constructed the generalized shift-splitting (GSS) preconditioner, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized shift-splitting (GSS) preconditioner, we generalize their algorithms and further study the parameter shift-splitting (PSS) preconditioner for complex symmetric linear systems. Moreover, by similar theoretical analysis, we obtain that the parameter shift-splitting iterative method is unconditionally convergent. In finally, one example is provided to confirm the effectiveness.
- 1 January 2024
- Published by Wilmington Scientific Publisher, LLC in Journal of Applied Analysis & Computation
- Vol. 14 (5) , 2877-2889
A PARAMETERIZED SHIFT-SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
Recently, Chen and Ma [Journal of Computational and Applied Mathematics, 344(2018): 691–700] constructed the generalized shift-splitting (GSS) preconditioner, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized shift-splitting (GSS) preconditioner, we generalize their algorithms and further study the parameter shift-splitting (PSS) preconditioner for complex symmetric linear systems. Moreover, by similar theoretical analysis, we obtain that the parameter shift-splitting iterative method is unconditionally convergent. In finally, one example is provided to confirm the effectiveness.
- 5 December 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 74 (1) , 1-15
Non-existence of global classical solutions to 1D compressible heat-conducting micropolar fluid
Institute of Mathematics of the Czech Academy of Sciences
- 5 December 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 74 (1) , 1-15
Non-existence of global classical solutions to 1D compressible heat-conducting micropolar fluid
Institute of Mathematics of the Czech Academy of Sciences
- Open Access
- 10 March 2023
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 15 (3)
Preface to the special issue on numerical simulations and optimization under uncertainty
- 10 March 2023
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 15 (3)
Open AccessPreface to the special issue on numerical simulations and optimization under uncertainty