** Next:** Synthetic example
** Up:** Problem formulation
** Previous:** Numerical algorithm

To accelerate the convergence of the iterative solution, we precondition
the inversion by the binning fold of the
data Chemingui and Biondi (1996b).
This is equivalent to a post-multiplication of the matrix L by a diagonal
matrix *C*^{-1}.

The preconditioning operator introduces a new model *x* given by

| |
(7) |

By the preconditioning transformation, we have recast the
original inversion relation equ1 into
| |
(8) |

The fold normalization is an approximate solution
to the column-scaling preconditioning
Ronen (1994), which is a normalization by the coverage after AMO.

** Next:** Synthetic example
** Up:** Problem formulation
** Previous:** Numerical algorithm
Stanford Exploration Project

10/9/1997