Sparse inversion of Stokes profiles: I. Two-dimensional Milne-Eddington inversions

Context. Inversion codes are numerical tools used to infer physical properties from observations. Despite their success, the quality of current spectropolarimetric observations and those expected in the near future presents a challenge to current inversion codes. Aims. The pixel-by-pixel strategy of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Astronomy and astrophysics (Berlin) 2015-05, Vol.577, p.A140
Hauptverfasser: Ramos, A Asensio, Rodriguez, J de la Cruz
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Context. Inversion codes are numerical tools used to infer physical properties from observations. Despite their success, the quality of current spectropolarimetric observations and those expected in the near future presents a challenge to current inversion codes. Aims. The pixel-by-pixel strategy of inverting spectropolarimetric data that we currently use needs to be surpassed and improved. The inverted physical parameters have to take into account the spatial correlation that is present in the data and that contains valuable physical information. Methods. We used the concept of sparsity or compressibility to develop a new generation of inversion codes for the Stokes parameters. The inversion code uses numerical optimization techniques based on the idea of proximal algorithms to impose sparsity. In so doing, we allow for the first time exploiting the spatial correlation on the maps of physical parameters. Sparsity also regularizes the solution by reducing the number of unknowns. Results. We compare the results of the new inversion code with pixel-by-pixel inversions to demonstrate the increased robustness of the solution. We also show how the method can easily compensate for the effect of the telescope point spread function, producing solutions with an enhanced contrast.
ISSN:0004-6361
1432-0746
1432-0746
DOI:10.1051/0004-6361/201425508