Quantitative analysis of the convergence for the Picard and the GN-PCG method. The test problem is the UT images (see section 5.1 for more details on the construction of this synthetic registration problem). We compare convergence results for plain H2-regularization (γ = 0; top block) and the Stokes regularization scheme (γ = 1; bottom block; H1-regularization) for empirically chosen regularization parameters β ∈ {1E–2, 1E–3}. We report results for different grid sizes
, i = 1, 2, nt = 4 max(nx). We invert for a stationary velocity field (i.e., nc = 1). We terminate the optimization if the relative change of the ℓ∞-norm of the reduced gradient gh is larger than or equal to three orders of magnitude or if the change in 𝒥h between 10 successive iterations is below or equal to 1E–6 (i.e., the algorithm stagnates). We report the number of the (outer) iterations (k★), the number of the hyperbolic PDE solves (nPDE) and the relative change of (i) the L2-distance (
), (ii) the objective (
), and (iii) the (reduced) gradient (||gh||∞,rel) as well as the average number of the line search steps ᾱ. Note that we introduced a memory for the step size into the Picard method to stabilize the optimization (see section 4.3.5 and the description of the results). The definitions for the reported measures can be found in Table 2. This study directly relates to the results for the smooth registration problem (see section 5.3.2, in particular Table 4).