Pygimli Inversion #624
-
Hi Pygimli team, I have some fundamental questions regarding the inversion framework. It is mentioned that "The default inversion framework is based on the generalized Gauss-Newton method" and further that the application of the Gauss-Newton scheme on minimizing the objective function The system of above equations has to be solved in every iteration step. Furthermore, how is the smoothness How the implemented inverse optimisation method is different from conventional Gauss-newton method? |
Beta Was this translation helpful? Give feedback.
Replies: 3 comments 6 replies
-
Gauss-Newton is a minimization method, i.e. a way to iteratively find a model update using the Jacobian matrix (2nd derivative), whereas there are also gradient-based minimization schemes like NLCG (nonlinear conjugate gradients). So solve the inverse subproblem, we use a conjugate-gradient least-squares solver. The smoothness matrix is a sparse matrix defining 1st or 2nd (or 0th or mixes of them) order derivatives. For details on all this please have a look at Günther et al. (2006). Günther, T., Rücker, C. & Spitzer, K. (2006): Three-dimensional modeling and inversion of dc resistivity data in- |
Beta Was this translation helpful? Give feedback.
-
I just want to check the final thing. What is the abbreviation for the name I read your PhD thesis but found it difficult to find this. May I request that you refer me to the relevant section? |
Beta Was this translation helpful? Give feedback.
-
Just want to add here for reference. Some information about constraint/smoothness matrix was discussed in #688. |
Beta Was this translation helpful? Give feedback.
Yes, with secondary notes as explained in Girou & Laroche