Communications on Applied Mathematics and Computation ›› 2025, Vol. 7 ›› Issue (3): 954-969.doi: 10.1007/s42967-024-00427-5

• ORIGINAL PAPERS • 上一篇    下一篇

On a Nonlinear Fast Deterministic Block Kaczmarz Method for Solving Nonlinear Equations

Yun-Xia Tan, Zheng-Da Huang   

  1. School of Mathematical Sciences, Zhejiang University, Hangzhou 310058, Zhejiang, China
  • 收稿日期:2023-11-28 修回日期:2024-05-01 接受日期:2024-05-03 出版日期:2025-09-20 发布日期:2025-05-23
  • 通讯作者: Zheng-Da Huang, zdhuang@zju.edu.cn;Yun-Xia Tan, 22135059@zju.edu.cn E-mail:zdhuang@zju.edu.cn;22135059@zju.edu.cn

On a Nonlinear Fast Deterministic Block Kaczmarz Method for Solving Nonlinear Equations

Yun-Xia Tan, Zheng-Da Huang   

  1. School of Mathematical Sciences, Zhejiang University, Hangzhou 310058, Zhejiang, China
  • Received:2023-11-28 Revised:2024-05-01 Accepted:2024-05-03 Online:2025-09-20 Published:2025-05-23

摘要: For solving large-scale nonlinear equations, a nonlinear fast deterministic block Kaczmarz method based on a greedy strategy is proposed. The method is adaptive and does not need to compute the pseudoinverses of submatrices. It is proved that themethod will converge linearly to the nearest solution to the initial point under mild conditions. Numerical experiments are performed to illustrate that the method is efficient at least for the tested problems.

关键词: Greedy, Deterministic, Block, Kaczmarz, Newton, Convergence

Abstract: For solving large-scale nonlinear equations, a nonlinear fast deterministic block Kaczmarz method based on a greedy strategy is proposed. The method is adaptive and does not need to compute the pseudoinverses of submatrices. It is proved that themethod will converge linearly to the nearest solution to the initial point under mild conditions. Numerical experiments are performed to illustrate that the method is efficient at least for the tested problems.

Key words: Greedy, Deterministic, Block, Kaczmarz, Newton, Convergence

中图分类号: