ABSTRACT
The iteration step to obtain Un from Un-1 is as follows. Given a mesh size 8 > 0, partition the u-axis with grid points vk = k8. The function inverse to Un_ 1 induces a partition { ~j} of the interval 0 ~ x ~ 1 such that each interval ~j ~ x ~ ~j+1 is mapped by Un_ 1 into an interval vk ~ u ~ vk+1. On the interval ~j < x < ~i+1 we set 'ih = 0.5( vk + Vk+1 ) and approximate f in (33) by the linear function
(34)
computed approximations to the gradient. In the Chin-Krasny method the mesh selection is based on Un itself.
