Iterative Refinement and Flexible Iteratively Reweighed Solvers for Linear Inverse Problems with Sparse Solutions
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910813973905408 |
|---|---|
| author | Onisk, Lucas Landman, Malena Sabaté |
| author_facet | Onisk, Lucas Landman, Malena Sabaté |
| contents | This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the lens of iterative refinement. This framework leverages the efficiency and fast convergence of flexible Krylov methods while achieving higher accuracy through suitable restarts. Additionally, we demonstrate that the proposed methods outperform other flexible Krylov approaches in memory-limited scenarios. Relevant convergence theory is discussed, and the performance of the proposed algorithms is illustrated through a range of numerical examples, including image deblurring and computed tomography. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_02303 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Iterative Refinement and Flexible Iteratively Reweighed Solvers for Linear Inverse Problems with Sparse Solutions Onisk, Lucas Landman, Malena Sabaté Numerical Analysis 65F22, 65F10, 15A29, This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the lens of iterative refinement. This framework leverages the efficiency and fast convergence of flexible Krylov methods while achieving higher accuracy through suitable restarts. Additionally, we demonstrate that the proposed methods outperform other flexible Krylov approaches in memory-limited scenarios. Relevant convergence theory is discussed, and the performance of the proposed algorithms is illustrated through a range of numerical examples, including image deblurring and computed tomography. |
| title | Iterative Refinement and Flexible Iteratively Reweighed Solvers for Linear Inverse Problems with Sparse Solutions |
| topic | Numerical Analysis 65F22, 65F10, 15A29, |
| url | https://arxiv.org/abs/2502.02303 |