Mixed precision iterative refinement for linear inverse problems
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914105367986176 |
|---|---|
| author | Nagy, James G. Onisk, Lucas |
| author_facet | Nagy, James G. Onisk, Lucas |
| contents | This study investigates the iterative refinement method applied to the solution of linear discrete inverse problems by considering its application to the Tikhonov problem in mixed precision. Previous works on mixed precision iterative refinement methods for the solution of symmetric positive definite linear systems and least-squares problems have shown regularization to be a key requirement when computing low precision factorizations. For problems that are naturally severely ill-posed, we formulate the iterates of iterative refinement in mixed precision as a filtered solution using the preconditioned Landweber method with a Tikhonov-type preconditioner. Through numerical examples simulating various mixed precision choices, we showcase the filtering properties of the method and the achievement of comparable working accuracy of discrete inverse problems (i.e., to within a few decimal places in relative error) compared to results computed in double precision as well as another approximate iterative refinement method which we use as a benchmark. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_08335 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Mixed precision iterative refinement for linear inverse problems Nagy, James G. Onisk, Lucas Numerical Analysis 5A29 65F10 65F22 65F08 This study investigates the iterative refinement method applied to the solution of linear discrete inverse problems by considering its application to the Tikhonov problem in mixed precision. Previous works on mixed precision iterative refinement methods for the solution of symmetric positive definite linear systems and least-squares problems have shown regularization to be a key requirement when computing low precision factorizations. For problems that are naturally severely ill-posed, we formulate the iterates of iterative refinement in mixed precision as a filtered solution using the preconditioned Landweber method with a Tikhonov-type preconditioner. Through numerical examples simulating various mixed precision choices, we showcase the filtering properties of the method and the achievement of comparable working accuracy of discrete inverse problems (i.e., to within a few decimal places in relative error) compared to results computed in double precision as well as another approximate iterative refinement method which we use as a benchmark. |
| title | Mixed precision iterative refinement for linear inverse problems |
| topic | Numerical Analysis 5A29 65F10 65F22 65F08 |
| url | https://arxiv.org/abs/2409.08335 |