![]() |
(47) |
![]() |
(48) |
Because a scaled adjoint is a guess at the solution to the fitting problem,
it is logical to choose
values for and the smoothing parameters
that give fastest convergence of the conjugate-direction solver.
To go beyond the scaled adjoint we can use as a preconditioner.
To use
as a preconditioner
we define implicitly a new set of variables
by the substitution
.Then
.To find
instead of
,we do CD iteration
with the operator
instead of with
.As usual, the first step of the iteration is to use the adjoint
of
to form the image
.At the end of the iterations,
we convert from
back to
with
.The result after the first iteration
turns out to be the same as Symes scaling.
By (47), has physical units inverse to
.Thus the transformation
has no units
so the
variables have physical units of data space.
It might be more practical to view the solution
with data units than to view the solution
with the more theoretical model units.
Some experience tells me that the ideas of this section are defective.
Appropriate scaling is required in both data space and model space.
We need both
and
where
.
I have a useful practical example (stacking in v(z) media)
in another of my electronic books (BEI),
where I found both
and
by iterative guessing.
But I don't know how to give you a general strategy.
I feel this is a major unsolved(?) opportunity for someone.