Random Greedy Fast Block Kaczmarz Method for Solving Large-Scale Nonlinear Systems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908487733215232 |
|---|---|
| author | Ding, Renjie Wang, Dongling |
| author_facet | Ding, Renjie Wang, Dongling |
| contents | To efficiently solve large scale nonlinear systems, we propose a novel Random Greedy Fast Block Kaczmarz method. This approach integrates the strengths of random and greedy strategies while avoiding the computationally expensive pseudoinversion of Jacobian submatrices, thus enabling efficient solutions for large scale problems. Our theoretical analysis establishes that the proposed method achieves linear convergence in expectation, with its convergence rates upper bound determined by the stochastic greedy condition number and the relaxation parameter. Numerical experiments confirm that when the Jacobian matrix exhibits a favorable stochastic greedy condition number and an appropriate relaxation parameter is selected, the algorithm convergence is significantly accelerated. As a result, the proposed method outperforms other comparable algorithms in both efficiency and robustness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09596 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Random Greedy Fast Block Kaczmarz Method for Solving Large-Scale Nonlinear Systems Ding, Renjie Wang, Dongling Numerical Analysis To efficiently solve large scale nonlinear systems, we propose a novel Random Greedy Fast Block Kaczmarz method. This approach integrates the strengths of random and greedy strategies while avoiding the computationally expensive pseudoinversion of Jacobian submatrices, thus enabling efficient solutions for large scale problems. Our theoretical analysis establishes that the proposed method achieves linear convergence in expectation, with its convergence rates upper bound determined by the stochastic greedy condition number and the relaxation parameter. Numerical experiments confirm that when the Jacobian matrix exhibits a favorable stochastic greedy condition number and an appropriate relaxation parameter is selected, the algorithm convergence is significantly accelerated. As a result, the proposed method outperforms other comparable algorithms in both efficiency and robustness. |
| title | Random Greedy Fast Block Kaczmarz Method for Solving Large-Scale Nonlinear Systems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2508.09596 |