Next: Gridding method
Up: The inversion algorithm
Previous: Definition
Contents
All forward problems can be summarized by
![$\displaystyle O=[O_1, \ldots, O_{n_{obs}}]^T=f([p_1, \ldots, p_{n_{param}}]^T)$](img109.png) |
(2.3) |
where
are the observable values2.1 and
are the model parameters2.2. Generally, a new function
is constructed 2.3 which vanishes when
is equal to
. The inverse problem is equivalent to find the set of
that verifies
![$\displaystyle L([O_1, \ldots, O_{n_{obs}}]^T-f([p_1, \ldots, p_{n_{param}}]^T)=0$](img115.png) |
(2.4) |
Practically, the minimum of
is searched across the parameter space in different ways briefly explained in the following sections.
Subsections
2007-03-15