This shows you the differences between two versions of the page.

sep:courses:gp210_labs [2012/10/14 16:18] mandyman |
sep:courses:gp210_labs [2015/05/27 02:06] (current) |
||
---|---|---|---|

Line 6: | Line 6: | ||

^ **Assignment List** ^ | ^ **Assignment List** ^ | ||

| | **Name ** | **Description ** | **Due ** | **Download ** | | | | **Name ** | **Description ** | **Due ** | **Download ** | | ||

- | | {{sep:courses:gif:lab1.gif}} | **Getting to know your data** | This lab is meant to help you think of data in a physical way rather than a binary one. Keep in mind that the focus of this lab is on your analysis of the data rather than on programming. | Oct 5th |{{sep:courses:labs210:lab1_fortran.pdf|lab1_fortran.pdf(fortran)}}, {{sep:courses:labs210:lab1_fortran.tar|lab1_fortran.tar(fortran)}}, {{sep:courses:labs210:lab1_matlab.pdf|lab1_matlab.pdf(matlab)}}, {{sep:courses:labs210:lab1_matlab.tar|lab1_matlab.tar(matlab)}} | | + | | {{sep:courses:gif:lab1.gif}} | **Getting to know your data** | This lab is meant to help you think of data in a physical way rather than a binary one. Keep in mind that the focus of this lab is on your analysis of the data rather than on programming. | | [[http://sepwww.stanford.edu/data/media/public/sep/prof/Lab1_fortran.pdf|Lab1_fortran.pdf]] [[http://sepwww.stanford.edu/data/media/public/sep/prof/Lab1_fortran.tar|Lab1_fortran.tar]] | |

- | | {{sep:courses:gif:lab2.gif}} | **Causal and anti-causal integration plus fun with adjoints** | You are first given a subroutine which performs causal andanti-causal integration. Your task is to code the adjoint and the dot product test to verify that the given anti-causal integration is the adjoint of the causal integration. Then you will have to answer some questions and apply the concept of causal and anti-causal integration. Secondly, you will have several subroutines withthe adjoints removed. The adjoints are also provided, so you simply have to match the correct adjoint with each subroutine. | Oct 12th |{{sep:courses:labs210:lab2_fortran.pdf|lab2_fortran.pdf(fortran)}}, {{sep:courses:labs210:lab2_fortran.tar|lab2_fortran.tar(fortran)}}, {{sep:courses:labs210:lab2_matlab.pdf|lab2_matlab.pdf(matlab)}}, {{sep:courses:labs210:lab2_matlab.tar|lab2_matlab.tar(matlab)}} | | + | | {{sep:courses:gif:lab2.gif}} | **Causal and anti-causal integration plus fun with adjoints** | You are first given a subroutine which performs causal andanti-causal integration. Your task is to code the adjoint and the dot product test to verify that the given anti-causal integration is the adjoint of the causal integration. Then you will have to answer some questions and apply the concept of causal and anti-causal integration. Secondly, you will have several subroutines withthe adjoints removed. The adjoints are also provided, so you simply have to match the correct adjoint with each subroutine. | | | |

- | | {{sep:courses:gif:lab3.gif}} | ** Normal move-out, multiples and velocity analysis** | This lab is based on material from Chapters 3 and 4 of BEI. In the first portion you will be asked to select a velocity function that best flattens an NMO gather. In the second portion of the lab you will be given a velocity scan of the same cmp gather and asked to reselect the velocity function. In the final portion you will be given a multiple contaminated CMP gather, and asked to correct it based on both the primary and multiple trend of the data. | Oct 22nd | {{sep:courses:labs210:lab3_fortran.pdf|lab3_fortran.pdf(fortran)}}, {{sep:courses:labs210:lab3_fortran.tar|lab3_fortran.tar(fortran)}} | | + | | {{sep:courses:gif:lab3.gif}} | ** Normal move-out, multiples and velocity analysis** | This lab is based on material from Chapters 3 and 4 of BEI. In the first portion you will be asked to select a velocity function that best flattens an NMO gather. In the second portion of the lab you will be given a velocity scan of the same cmp gather and asked to reselect the velocity function. In the final portion you will be given a multiple contaminated CMP gather, and asked to correct it based on both the primary and multiple trend of the data. | | | |

- | | {{sep:courses:gif:lab4.gif}} | **Kirchhoff migration** | In this computer exercise you will modify the Kirchhoff migration and modeling subroutine that was presented in class. First you will limit the propagation angles in the subroutine, and then you will modify the subroutine to handle //v(z)//, also you will limit the aperture in the subroutine, and compare it with angle limitation. | - | - | | + | | {{sep:courses:gif:lab4.gif}} | **Kirchhoff migration** | In this computer exercise you will modify the Kirchhoff migration and modeling subroutine that was presented in class. First you will limit the propagation angles in the subroutine, and then you will modify the subroutine to handle //v(z)//, also you will limit the aperture in the subroutine, and compare it with angle limitation. | | | |

- | | {{sep:courses:gif:lab5.gif}} | **2D FFT** | In this lab you will modify programs to filter data based on the dip, and use it to process a VSP and remove multiples from a CMP gather. | - | - | | + | | {{sep:courses:gif:lab5.gif}} | **2D FFT** | In this lab you will modify programs to filter data based on the dip, and use it to process a VSP and remove multiples from a CMP gather. | | | |

- | | {{sep:courses:gif:lab6.gif}} | **Phase shift downward and upward continuation** | In this exercise you are provided with a modified version of the phase shift migration and modeling programs found in //Basic Earth Imaging// (BEI). The program has been arranged so that it outputs snapshots of a wavefield as it is upward continued and downward continued. This week's programming task will be to add depth-variable velocity to the phase shift program and change Makefile to reduce boundary artifacts. | - |-| | + | | {{sep:courses:gif:lab6.gif}} | **Phase shift downward and upward continuation** | In this exercise you are provided with a modified version of the phase shift migration and modeling programs found in //Basic Earth Imaging// (BEI). The program has been arranged so that it outputs snapshots of a wavefield as it is upward continued and downward continued. This week's programming task will be to add depth-variable velocity to the phase shift program and change Makefile to reduce boundary artifacts. | | | |

- | | {{sep:courses:gif:lab7.gif}} | **Finite difference wavefield extrapolation** | In this lab we solve the parabolic wave-equation in 2-D by implicit finite-difference methods in frequency space. The exercises come from BEI Section 10.4. You have to change the subroutine wavemovie to reproduce the movies from which the Figures in that section are taken. | - | - | | + | | {{sep:courses:gif:lab7.gif}} | **Time-domain Finite-difference wavefield extrapolation** | In this exercise you will familiarize yourself with full wave-equation modeling. You will first review the stability and dispersion condition in modeling using the isotropic acoustic wave equation. You will then derive the 8th order coefficients of the Laplacian operator for time-domain finite difference wavefield extrapolation. Finally, you will implement the coefficients and create a movie of the wavefield | | | |

- | | {{sep:courses:gif:lab8.gif}} | **3D Finite difference wavefield extrapolation ** | In this lab we solve the parabolic wave-equation in 3-D by implicit finite-difference methods and helical boundary conditions in frequency space. | - | - | | + | | {{sep:courses:gif:lab8.gif}} | **Reverse Time Migration ** | The goal of this lab is to get you familiarize with coding wave propagation and reverse time migration (RTM). You will be given a module that contains all the necessary subroutines for RTM. There are two programming tasks for this lab. The ﬁrst task involves completing a subroutine that performs the time-marching using the time-domain ﬁnite diﬀerence (TDFD) algorithm. The second task is to write the main program that uses the subroutines in the propagation module. Finally, with your completed RTM code, you will depth-migrate several pre-stack images of the Sigsbee model.| | | |

\\ | \\ | ||

\\ | \\ | ||

{{page>share:footer&nofooter&noeditbtn}} \\ | {{page>share:footer&nofooter&noeditbtn}} \\ |