Each delay is a sum over the cells a ray crosses
Split the region into cells with a constant slowness perturbation each, the change in inverse speed relative to a background. If rays are straight and the perturbations are small, a ray’s delay is the sum over cells of the length of the ray in each cell times that cell’s perturbation. Section 4.19 of the MIT 12.201 notes writes the system this way, with the matrix holding path lengths.
Rawlinson and Spakman write the same system as their Eq. 6 and list what the error term holds: picking error, error of the forward theory, linearization error and the error of describing a smooth Earth with cells. The tomography Lab computes its delays by integrating smooth anomalies along each ray, so its data carry that last error too.
Damping and smoothing choose one answer
Patterns that no ray can see form the null space of the matrix. Adding any of them to a model leaves every delay unchanged, so the data alone cannot pick a model. The usual cure adds penalties to the misfit: one on the size of the model, called damping, and one on its roughness, called smoothing. Rawlinson and Spakman write this cost as their Eq. 7 and the resulting generalized inverse as Eq. 9.
The tomography Lab uses a damping weight and a smoothing weight, each set on a log scale and multiplied by the mean diagonal of the data term so that the sliders mean the same thing for every ray geometry.
The resolution matrix maps truth into the image
Insert the true model into the solution. The image equals the resolution matrix times the truth plus the inverse applied to the errors (Rawlinson and Spakman, Eqs. 10 to 13). If the resolution matrix were the identity, every cell would be recovered exactly. In practice each row is a blur: it shows which true cells leak into one image cell.
The noise term is a separate matter. Its spread is the model covariance of Eq. 14, which depends only on the assumed data errors and the inverse, not on the data. A model can have a resolution matrix close to the identity and still be dominated by noise.
A synthetic test inverts noise-free delays from a made-up model through the same matrix and inverse. By Eq. 16 its output is the resolution matrix times the made-up model, which is why checkerboard and spike tests reveal properties of the resolution matrix.
One test pattern cannot show all the blur
A checkerboard test can look perfect while larger structures are lost. Rawlinson and Spakman cite an idealized experiment by Lévêque and co-authors in which a fine checkerboard was recovered perfectly and a coarse one sat almost entirely in the null space, with the same rays. A recovered checkerboard therefore shows only that this pattern is resolved; a failed one shows a lack of resolution.
In the tomography Lab the checkerboard test gives a pattern match of 0.899 with the full ring, higher than the 0.724 for the two smooth anomalies. The test pattern looks better resolved than the real target.
Worked example
A grid of four cells with a hidden pattern
Take four square cells of side 1 km, numbered across the top row and then the bottom row. Two horizontal rays run along the rows and two vertical rays along the columns, so each ray spends 1 km in each of two cells.
The four delays add the top row, the bottom row, the left column and the right column. The pattern plus one, minus one, minus one, plus one adds to zero along every ray. It is in the null space, so the matrix has rank three, not four.
The minimum-length solution projects out that pattern, and its resolution matrix is the identity minus the outer product of the normalized null vector. Put a slowness anomaly of 0.0100 s/km in the top-left cell only. The data are 0.0100 s on the top-row ray and the left-column ray, and zero on the other two. The recovered model is 0.0075 in the top-left cell, 0.0025 in its two neighbours and minus 0.0025 in the opposite corner: three quarters of the spike, smeared into a cross.
Add one diagonal ray from the top-left corner to the bottom-right corner. It spends 1.41 km in each of the two diagonal cells, its delay changes when the hidden pattern is added, the null space disappears and the spike is recovered exactly.