TRAVELTIME TOMOGRAPHY (CONT)

Transcription

1 30 March 005 MODE UNIQUENESS The forward model TRAVETIME TOMOGRAPHY (CONT di = A ik m k d = Am (1 Data vecto r Sensitivit y matrix Model vector states the linearized relationship between data and model via a mapping or sensitivity matrix, where i = 1,,, N (data and k = 1,,, M (model parameters. In the case of GRT traveltime tomography, A can be thought of as a sparse sampling matrix whose nonzero elements are the lengths of segments of the raypath within each discretized voxel of the Earth. l 11 l 1M ray 1 A M O M M l N 1 l NM ray N Normally, N >> M the number of data (typically ~ is far greater than the number of model parameters (typically ~ making (1 nominally overdetermined. Consequently, A is normally not square. We can invert for m by first left-multiplying (1 by A T T T A Am = A d and then, since A T A is square, we complete the inversion to yield the classic least squares solution, as follows: T 1 T m = ( A A A d. ( The penalty function that is satisfied by ( is ε m ( T 1 T A A d A (3 where m (plugged in for m in (3 minimizes ε in the least squares sense. Aside: penalty metrics other than the squared norm in (3 can be used; the absolute norm, for example. As stated above, N >> M Æ the system is nominally overdetermined. But A is often rank-deficient mathematically, rank(a << M and therefore the system behaves as though it is underdetermined. In other words, many of the N observations are linearly dependent and so do not provide complementary information on the subsurface. To understand this, consider the worst-case scenario where we have 10 6 observations that travel along the exact same raypath like the figure shown at right. Only cells traversed by the ray are actually sampled, meaning that unsampled cells are completely unconstrained. From an inverse point of view, the unconstrained parameter cells make the problem underdetermined there are more parameters than S R 1

2 30 March 005 there are complementary pieces of information to constrain the system. When an inverse problem is underdetermined, all the following statements are true and/or synonymous: {1} the problem is ill-posed; {} A T A is singular/non-invertible/rank-deficient; {3} one or more rows or columns of A and A T A are linearly dependent; {4} one or more parameters are unconstrained; {5} A and A T A both have nontrivial null spaces. All parts of a discretized model that are unconstrained or, equivalently, that are not mapped by A from model space into data space reside in the null space of A. This means that ε is independent of unconstrained parameters; an unconstrained parameter can take on any value without affecting ε. So the least squares solution is not unique if one or more parameters are unconstrained! In fact, there is an infinite set of solutions that equally minimize ε. Namely, any prospective solution that contains the true solution (which we don t know linearly combined with any of the vectors in null (A will equally minimize ε. This is termed nonuniqueness. REGUARIZATION AND DAMPING Model regularization essentially adds additional constraints to the inverse problem to address the solution nonuniqueness that arises as a consequence of ill-posedness. For example, the expression a + b = is ill-posed if we are asked to find values for both a and b. There are an infinite number of combinations of a and b that equally satisfy this expression, so the inverse problem is nonunique. But if we add an extra condition or constraint that specifies λ 1 ( a b = 0, where λ 1 is a user-specified weight (a.k.a. agrange multiplier, we now have a well-posed system of two equations in two unknowns (provided λ 1 0. The unique solution to this system is a = b = 1. This second expression is a form of model regularization. It assumes that a functional relationship exists between the model parameters (in this case, it basically assumes that a = b that can be used to add information and thereby constrain the original problem. This idea can be applied to (3 by augmenting it with an additional regularization condition: ( T ε= m A A 1 A T d + λ 1 m (4 where, for example, can defined as the gradient or first-difference operator M O O O O that basically reduces the difference between adjacent model parameters in m. This type of constraint requires that neighboring model parameters be of similar magnitude. For this reason, the second term on the RHS of (4 is often referred to as a smoothness constraint. The strength

3 30 March 005 of the weight λ 1 specifies how important parameter smoothness should be in relation to the main objective (the first term on the RHS, which is to minimize the residual in the least squares sense. Regularization can be implemented by augmenting the system of equations. In block matrix form, the regularized forward problem is written A d m =, λ 1 0 (5 and m can be found in the usual way by (. Another constraint customarily employed in inversion is norm damping. For unconstrained parameters, it is often desirable to at least constrain them to be physically reasonable. In fact, if we don t have any data that constrains particular parameters, it s just as well to make them zero, or at least something small. Going back to the simple two-parameter problem at the beginning of this section, we might additionally constrain the problem by a second constraint: λ a =0 λ b =0 again, where λ is a weight (agrange multiplier specifying the importance of this objective. Applying this idea to (4, we create a new penalty function, ( T ε= m A A 1 A T d + m +λ m. (6 Squared error λ 1 Smoothness Norm constraint Constraint Damping applies a norm constraint to the problem. That is to say, it constrains the parameters to be small; large values in m would make its norm large and would therefore make ε big. In the limit as λ Æ, all the parameters would be zero. The augmented forward problem is expressed as A d λ1 m = 0, λ I 0 and, as with (5, m can be found by employing (. (7 RESOUTION Equation (1 establishes a forward mapping from model to data space (cartooned by the top arrow in the figure at right and Equation ( establishes the inverse mapping from data to model space Data Space A T T ( A A 1 A Model Space 3

4 30 March 005 (cartooned by the bottom arrow. We would especially like to know how well we resolve model parameters via the inverse mapping. Combining (1 and (, we get m ( A A ( A A m, (8 and we define the resolution matrix as so that R ( T 1 T T 1 T A A ( A m Rm. A (9 Clearly, if R = I then all the parameters are equally and perfectly resolved. In practice, R will often be diagonally dominant, but the main diagonals will not all be one and the off-diagonals will often be different from zero. By analyzing the diagonals of R, we gather information on how well resolved the parameters are (resolution increases as the diagonal values approach unity. The off-diagonal terms tell us about smearing between parameters. However, in seismic tomography, A frequently contains billions or even trillions of elements, so formally computing R is impractical (impossible?. There are a number of ways to circumnavigate this difficulty. The two methods described here are the checkerboard resolution test and the hypothesis test. The checkerboard resolution test basically utilizes a synthetic Earth model wherein seismic velocities alternate between slow and fast, in a checkerboard pattern: m syn is mapped to synthetic data by m syn checkerboard. d syn = Am syn, and then d syn is inverted to create the inversion model We can then consider the resolution metric T 1 T syn m = ( A A A d. m m syn syn or we can simply visually inspect m syn to see how well it tallies with m syn. The following observations can be made about checkerboard resolution tests: The greatest model resolution, not surprisingly, occurs over continental landmasses Many regions over open oceans apparently cannot be resolved at all. Deep mantle model parameters are generally better resolved than ones nearer the surface because there is better data coverage provided by deep diving waves. Model regularizations used in the inversions tend to provide poorer amplitude resolution than spatial resolution. These test types assume A is known. But A is an approximation of physical reality. syn 4

5 30 March 005 The hypothesis testing method is less arbitrary than the checkerboard method. Rather than test the resolution of an unrealistic Earth model, which is only marginally informative at best, this method tests a null hypothesis. The null hypothesis can be any Earth model that is similar to the current inversion model, but that differs in some way that would be important from an interpretive viewpoint. et the current and null hypothesis models be denoted, respectively, m 0 and m null. The null hypothesis Earth model is mapped to data space via A and then inverted back -1 T -1 A so we re considering (A T A (A T A m null. If m null is similar to to model space via (A T A -1 (A T A (A T A m null at those places where m null was purposely made to differ from m 0, then there -1 is sufficient resolution in these regions and the null hypothesis is rejected. If (A T A (A T A m null looks like m 0 then the null hypothesis is accepted the data do not constrain the parameters enough to distinguish between m 0 and m null. So, when the null hypothesis is rejected, we have resolution in regions of interest; but if it is accepted, then both the null hypothesis and the original inversion model can equally explain the data, which presents a problem as far as interpretation is concerned. Hypothesis testing is easily visualized using the block diagram shown in Figure 1. Tomographic model with anomaly ( m 0 Null hypothesis model (m null with dashed outline of m 0 for comparison Hypothesis test Figure 1 Block diagram cartooning hypothesis testing for resolution. The top left panel depicts a tomographic image with one anomaly. We would T 1 T ( like to know, for example, whether the A A ( A A m null data provides enough resolution to unequivocally interpret this anomaly as a contiguous body or perhaps as two separate bodies (as seen in the top right nu ll hypothesis panel. To do this, apply (A T A -1 A T A to m null and check to see whether the two-anomaly or hypothesis is preserved. If it is, the hypothesis is rejected; there is enough resolution to distinguish between the two models. If not, the hypothesis is Reject Resolution is sufficient Accept Resolution is accepted; we do not have enough to distinguish between models. insufficient to distinguish resolution to reasonably distinguish between models. between the null hypothesis and the original image. 5

6 30 March 005 FRESNE ZONES AND MUTIPATH/SCATTERING We have d = Gδµ dv Volume but we only need to worry about those portions of Gδµ that are nonzero. Geometric Ray Theory employs a high-frequency approximation that allows us to assume that Gδµ is only nonzero along the ray path. So the preceding integral can be reduced to δ t = s dl. ray This simplification breaks down when we consider finite frequencies. For finite frequencies, we employ the analytical tools of Fresnel zones and multipathing/scattering. These concepts provide more realistic 3D kernels applicable to Earth models. Fresnel Zones S R Rays traveling from S to R will follow not only the GRT raypath, but also any number of excursive paths. If the lengths of these excursive paths,, do not differ from (the GRT raypath length by more λ /4, they will constructively interfere. In other words: < λ 4 constructive interference T T < T 4 = s + w + ( s + w w S λ 1/ w S - S 8 R w denotes the radius of a Fresnel Zone. It specifies a cross-sectional area through which constructively interfering rays travel from S to R. So the waveform observed at R is no longer dependent only on the GRT raypath, but the volume described by the Fresnel Zone. The arrival at R has now sampled a volume, as opposed to a line. ~ 1000km Æ w ~ 30km ~10,000km Æ w ~ 100km The excursive raypaths arrive later than the GRT raypath, creating constructive interference and the arrival coda. 6

7 30 March 005 The Fresnel Zone is shaped like a banana and is frequently referred to as the banana donut: In cross-section, the banana donut is represented by a series of concentric contours that correspond to the spatial sensitivity of the banana donut at each point. Interestingly, for finite frequencies, the sensitivity is identically zero at the center of the cross-section, which provides the counterintuitive insight that the GRT raypath is a path of zero sensitivity! Banana Donut Sensitivity Kernel Zero sensitivity The banana donut kernel (BDK replaces the elements in A, as described earlier in these notes. Because the BDK is a volume and not a raypath, A is no longer nearly as sparse as it is in the case of GRT. Moreover, because sensitivity is now distributed in a volume, the BDK A is less ill-posed than the GRT A. Hence, banana donut kernels will tend to increase resolution, as compared to GRT kernels. Multipathing The preceding ideas also naturally give rise to multipathing, which acknowledges that more than one raypath can satisfy Fermat s Principle. For example, a scattered ray might travel through a faster region and therefore arrive at the same time as the GRT ray. Consequently, the integral fast d = Volume Gδµ dv can be simplified to the sum of two integrals and this is the central idea of multipathing. δt = s dl ray1 ray + s dl, 7