New generation inversion codes A. Asensio Ramos Instituto de Astrofísica de Canarias (Spain) J. de la Cruz Rodríguez Institute for Solar Physics (Sweden) github.com/aasensio @aasensior aasensio.github.io/blog
New generation inversion codes
A. Asensio Ramos Instituto de Astrofísica de Canarias (Spain)
J. de la Cruz Rodríguez
Institute for Solar Physics (Sweden)
github.com/aasensio
@aasensior
aasensio.github.io/blog
Teenage generation – 21st century
• PCA regularized deconvolution (IAC) • Spatially coupled inversions [van Noort’s talk]
Why regularization?
• Pixel-by-pixel inversion
• No spatial correlation is used at all
• Noise induces degeneracies
• Your inversion code is surely biased (and you don’t know it)
• We know many things from our solution
Include a-priori knowledge Maximum-likelihood maximum a-posteriori
Do we need information for all pixels?
Nunknowns=Npixel x Nparameters
1000 x 1000 ~10-20 ~107
Redundant information!
Use a sparsifying (compressive) transformation
• Solution is sparse • Reduction in the number of unknowns
• Transformation is global
• A pixel contributes to all modes
How to solve the problem
Levenberg-Marquardt (gradient descent+Newton) cannot be used because the Hessian matrix is huge
• Cannot be built and/or approximated • Contrary to what happens with e.g., van Noort’s method
• Cannot be inverted
• Matrix is not sparse
Need to use accelerated first-order methods
First-order proximal algorithms
Optimization of a convex+non-convex function
Proximal gradient descent methods broadly used in ``big data’’
Computer code
• MPI parallel general inversion code (C++)
• Uses the FISTA algorithm (Beck & Teboulle 2009) with restarting (O’Donoghue & Candès 2012)
• Forward model is modular (+gradient)
• Sparsity: DCT, Wavelet, …
• Spatial deconvolution is added trivially
• We are studying thresholding strategies