previous up next print clean
Next: THE DIFFERENTIAL EQUATION Up: Claerbout: Canonical Gazdag routine Previous: Claerbout: Canonical Gazdag routine


None of my tutorial literature develops Gazdag migration and modeling code as conjugate pairs. The closest thing to it is PVI pages 122-3 Claerbout (1992). Here I present a constructive proof of the conjugacy leading up to clean beginners code that passes the dot product test. (Passing the dot-product test means that the constructed conjugate really is conjugate Claerbout (1992).)

Stanford Exploration Project