Estimating and using information in inverse problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915144870658048 |
|---|---|
| author | Bangerth, Wolfgang Johnson, Chris R. Njeru, Dennis K. Waanders, Bart van Bloemen |
| author_facet | Bangerth, Wolfgang Johnson, Chris R. Njeru, Dennis K. Waanders, Bart van Bloemen |
| contents | In inverse problems, one attempts to infer spatially variable functions from indirect measurements of a system. To practitioners of inverse problems, the concept of "information" is familiar when discussing key questions such as which parts of the function can be inferred accurately and which cannot. For example, it is generally understood that we can identify system parameters accurately only close to detectors, or along ray paths between sources and detectors, because we have "the most information" for these places. Although referenced in many publications, the "information" that is invoked in such contexts is not a well understood and clearly defined quantity.
Herein, we present a definition of information density that is based on the variance of coefficients as derived from a Bayesian reformulation of the inverse problem. We then discuss three areas in which this information density can be useful in practical algorithms for the solution of inverse problems, and illustrate the usefulness in one of these areas -- how to choose the discretization mesh for the function to be reconstructed -- using numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_09095 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Estimating and using information in inverse problems Bangerth, Wolfgang Johnson, Chris R. Njeru, Dennis K. Waanders, Bart van Bloemen Numerical Analysis Information Theory Analysis of PDEs 65N21, 35R30, 94A17 In inverse problems, one attempts to infer spatially variable functions from indirect measurements of a system. To practitioners of inverse problems, the concept of "information" is familiar when discussing key questions such as which parts of the function can be inferred accurately and which cannot. For example, it is generally understood that we can identify system parameters accurately only close to detectors, or along ray paths between sources and detectors, because we have "the most information" for these places. Although referenced in many publications, the "information" that is invoked in such contexts is not a well understood and clearly defined quantity. Herein, we present a definition of information density that is based on the variance of coefficients as derived from a Bayesian reformulation of the inverse problem. We then discuss three areas in which this information density can be useful in practical algorithms for the solution of inverse problems, and illustrate the usefulness in one of these areas -- how to choose the discretization mesh for the function to be reconstructed -- using numerical experiments. |
| title | Estimating and using information in inverse problems |
| topic | Numerical Analysis Information Theory Analysis of PDEs 65N21, 35R30, 94A17 |
| url | https://arxiv.org/abs/2208.09095 |