The GMRES method for solving the large indefinite least squares problem via an accelerated preconditioner
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918031972630528 |
|---|---|
| author | Li, Jun Meng, Lingsheng |
| author_facet | Li, Jun Meng, Lingsheng |
| contents | In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The construction idea of the preconditioner comes from the thought of Luo et.al [Luo, WH., Gu, XM., Carpentieri, B., BIT 62, 1983-2004(2022)], and the advantage of this is that the preconditioner is closer to the coefficient matrix of the block three-by-three linear systems when the parameter approachs zero. Theoretically, the iteration method under the preconditioner satisfies the conditional convergence, and all eigenvalues of the preconditioned matrix are real numbers and gathered at point $(1,0)$ as parameter is close to $0$. In the end, numerical results reflect that the theoretical results is correct and the proposed preconditioner is effective by comparing with serval existing preconditioners. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_17504 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The GMRES method for solving the large indefinite least squares problem via an accelerated preconditioner Li, Jun Meng, Lingsheng Numerical Analysis In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The construction idea of the preconditioner comes from the thought of Luo et.al [Luo, WH., Gu, XM., Carpentieri, B., BIT 62, 1983-2004(2022)], and the advantage of this is that the preconditioner is closer to the coefficient matrix of the block three-by-three linear systems when the parameter approachs zero. Theoretically, the iteration method under the preconditioner satisfies the conditional convergence, and all eigenvalues of the preconditioned matrix are real numbers and gathered at point $(1,0)$ as parameter is close to $0$. In the end, numerical results reflect that the theoretical results is correct and the proposed preconditioner is effective by comparing with serval existing preconditioners. |
| title | The GMRES method for solving the large indefinite least squares problem via an accelerated preconditioner |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2505.17504 |