Long-Ze Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Long-Ze Tan has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Xue-Ping Guo
East China Normal University
3 shared publications - Ming-Yu Deng
School of Statistics and Applied Mathematics, Anhui University of Finance & Economics, Bengbu 233030, China
1 shared publication
Latest Publications
- 25 March 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (4) , 1580-1597
On Multi-step Greedy Kaczmarz Method for Solving Large Sparse Consistent Linear Systems
- 25 March 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (4) , 1580-1597
On Multi-step Greedy Kaczmarz Method for Solving Large Sparse Consistent Linear Systems
- Open Access
- 20 January 2023
- Published by Springer Nature in Research Square
On nonlinear greedy randomized Kaczmarz methods for solving large-scale systems of nonlinear equations
The greedy randomized Kaczmarz (GRK) method is an efficient method for solving large-scale systems of linear equations. Based on this basic idea, we propose a nonlinear greedy randomized Kacz-marz (NGRK) method for solving large-scale systems of nonlinear equations and prove its convergence. Then, to improve the computational efficiency of the NGRK method, we design the multi-step NGRK (MNGRK) method and the accelerated NGK (ANGK) method, respectively. Theoretical results show that the convergence speed of the MNGRK and ANGK methods is faster than that of the NGRK method. Finally, inspired by the max-distance coordinate descent (MDCD) method, we also establish the nonlinear max-distance Kaczmarz (NMDK) method and its accelerated version.
- 20 January 2023
- Published by Springer Nature in Research Square
Open AccessOn nonlinear greedy randomized Kaczmarz methods for solving large-scale systems of nonlinear equations
The greedy randomized Kaczmarz (GRK) method is an efficient method for solving large-scale systems of linear equations. Based on this basic idea, we propose a nonlinear greedy randomized Kacz-marz (NGRK) method for solving large-scale systems of nonlinear equations and prove its convergence. Then, to improve the computational efficiency of the NGRK method, we design the multi-step NGRK (MNGRK) method and the accelerated NGK (ANGK) method, respectively. Theoretical results show that the convergence speed of the MNGRK and ANGK methods is faster than that of the NGRK method. Finally, inspired by the max-distance coordinate descent (MDCD) method, we also establish the nonlinear max-distance Kaczmarz (NMDK) method and its accelerated version.
- 7 January 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (1) , 1-20
On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
- 7 January 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (1) , 1-20
On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems