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

被引：0
|
作者：
Tan, Yun-Xia [1 ]
Huang, Zheng-Da [1 ]
机构：
[1] Zhejiang Univ, Sch Math Sci, Hangzhou 310058, Zhejiang, Peoples R China
来源：
COMMUNICATIONS ON APPLIED MATHEMATICS AND COMPUTATION | 2024年
基金：
中国国家自然科学基金;
关键词：
Greedy; Deterministic; Block; Kaczmarz; Newton; Convergence; ALGEBRAIC RECONSTRUCTION TECHNIQUES; ITERATIVE ALGORITHMS; CONVERGENCE RATE; SPARSE SYSTEMS;
D O I：
10.1007/s42967-024-00427-5
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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 the method 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.
引用
收藏
页码：954 / 969
页数：16
相关论文
共 50 条
12345