共查询到16条相似文献，搜索用时 163 毫秒
1.
三维复杂山地条件下的各种地震波型的走时计算技术,可以直接用于复杂山地区域地震波运动学特性的分析、地震数据采集观测系统的设计以及直接基于三维复杂地表的地震数据处理技术的研发.为了在三维复杂地表条件下准确、灵活且稳定地计算各种地震波型的走时,提出一种多级次群推进迎风混合法.该算法利用不等距迎风差分法简洁稳定地处理三维复杂地表及附近的局部走时计算问题,利用计算精度不错的迎风双线性插值法处理绝大部分均匀正方体网格中的局部走时计算问题,利用群推进法模拟三维复杂地表条件下地震波前的扩展问题,利用多级次算法处理各种类型的地震波的走时计算问题.算法分析和计算实例表明:新方法具有很好的计算精度与效率,且能灵活稳定地处理三维复杂地表复杂介质条件下的多波型走时计算问题. 相似文献
2.
三维起伏地表条件下的地震波走时计算技术是研究三维起伏地表地区很多地震数据处理技术的基础性工具.为了获得适应于任意三维起伏地表且计算精度高的走时算法,提出三维不等距迎风差分法.该方法采用不等距网格剖分三维起伏地表模型,通过在迎风差分格式中引入不等距差分格式、Huygens原理及Fermat原理来建立地表附近的局部走时计算公式,并通过在窄带技术中设定新的网格节点类型来获得三维起伏地表条件下算法的整体实现步骤.精度及算例分析表明:三维不等距迎风差分法具有很高的计算精度且能够适应于任意三维起伏地表模型. 相似文献
3.
复杂地形条件下地震波走时算法对于研究复杂地形地区的成像问题有着重要的意义.为了得到精度高且适应于复杂地形的走时算法,首先提出阶梯网格迎风差分法.然后将该方法与不等距网格有限差分法和混合网格线性插值法进行对比研究,得出如下结论:混合网格线性插值法的计算精度最高,但其计算效率最低;阶梯网格迎风差分法的计算精度最低,但其计算效率最高;不等距网格有限差分法的计算精度和计算效率均居中;而究竟选取哪种算法作为给定复杂地形模型的地震波走时算法,应该综合考虑地形的特点、所研究问题对计算精度及计算效率的要求等因素.最后通过一个计算实例验证了三种算法在面对复杂地形、近地表及地下复杂介质等复杂地质条件时均有很好的适应性和稳定性. 相似文献
4.
多个震源组合激发通过改变激发延时,可以得到沿某方向传播的地震波场,即定向地震波场激发技术,它可用于特定目标体的照明与探测之中.本文以水平地表的组合震源定向激发原理为基础,推导了倾斜地表情况下的组合震源定向激发公式,并计算绘制了其理论方向图.另外本文将组合震源波场定向方法推广至任意起伏地表,根据惠更斯菲涅尔原理,提出了旋转坐标方法,即将水平坐标旋转至定向波场传播方向法向的倾斜坐标,可方便地计算震源传播至定向波场波前面的走时,作为组合震源的激发延时.根据本文提出的方法,我们分别计算了倾斜地表条件与复杂地表条件定向地震波场的组合震源延时参数,通过波动方程数值模拟技术得到的波场快照验证了本文方法的有效性. 相似文献
5.
地震波走时广泛应用于静校正、层析成像、Kirchhoff偏移成像、地震定位等研究.复杂地表条件是影响走时计算精度的重要因素.近年来,发展的曲线坐标系程函方程为精细刻画起伏地表条件下的地震波走时场特征提供了新的思路.然而,基于有限差分程函方程的求解方法不可避免地受到震源奇异性的影响,即震源附近波前的曲率较大,此时使用平面波近似假设的差分格式会导致较大误差.而震源误差会随着波前的传播到达整个计算区域,从而影响整个区域的求解精度.针对该问题,本文借鉴因式分解的思想,推导建立了曲线坐标系因式分解程函方程,并针对性地发展了其数值求解方法,从根源上解决了复杂模型走时计算中的震源奇异性问题.数值实例表明因式分解法能够有效降低震源误差,显著提高起伏地表走时计算的精度和效率,为起伏地表地震波走时计算提供更佳的选择,在复杂模型的地震资料处理中展现出广泛的应用前景. 相似文献
6.
7.
8.
地震走时层析成像方法是解决复杂近地表模型速度建模问题的重要技术.该方法是一种迭代反演方法,在反演过程中需要反复计算地震射线走时.故而,高效高精度且能适应复杂模型的走时计算方法是地震走时层析成像实用化的关键技术之一.本文引入医学成像领域研究的MSFM(Multi-stencils Fast Marching Methods)用于地震层析反演中的走时计算.该方法在标准FMM(Fast Marching Methods)基础上利用坐标旋转生成新的FMM计算模板,使计算网格点对角方向邻点参与计算,改善了标准FMM存在对角方向误差大的缺陷.本文分析对比了MSFM和标准FMM的计算精度和计算效率;针对地震层析成像技术解决的起伏地表模型建模问题,研究了起伏地表模型地震走时计算的MSFM实现方法;采用炮点邻近区域局部细分网格技术只需增加很少的计算量即可大幅提高计算精度.理论分析和模型试算表明MSFM算法明显改善了FMM的计算精度,同时保持了FMM算法的高效性.文章通过对崎岖地表模型的正演和层析反演试算,验证了基于MSFM的地震走时计算方法对复杂模型有很强的适应能力.研究表明该方法作为地震走时层析反演中高效高精度的正演算法,有很好的应用价值. 相似文献
9.
10.
最短路径射线追踪算法,用预先设置的网络节点的连线表示地震波传播路径,当网络节点稀疏时,获得的射线路径呈之字形,计算的走时比实际走时系统偏大. 本文在波前扩展和反向确定射线路径的过程中,在每个矩形单元内,通过对某边界上的已知走时节点的走时进行线性插值,并利用Fermat原理即时求出从该边界到达其他边界节点的最小走时及其子震源位置和射线路径,发展了相应的动态网络算法. 从而克服了最短路径射线追踪算法的缺陷,大大提高了最小走时和射线路径的计算精度. 相似文献
11.
三维地震波走时计算技术是三维地震反演、层析成像、偏移成像等诸多地震数据处理技术中非常重要的正演计算工具.为了获得精度高且兼顾效率的三维走时计算方法:首先,在常规双线性插值公式推导过程中,充分利用平面波双线性假设的结论,获得了二元极小值超越方程的解析解,进而推导出了准确的局部走时计算公式,同时构造性地证明了该计算公式满足地震波的传播规律和Eikonal方程;其次,引入迎风差分的基本思想,提出迎风双线性插值的局部走时计算策略,该计算策略能简化算法、提高效率且保证无条件稳定性;然后,将上述计算公式和迎风双线性插值策略与常规快速推进法中的窄带技术结合,获得了一种新的基于快速推进迎风双线性插值法的三维地震波走时计算方法;最后,通过精度和效率分析检验了新算法的精度、效率和正确性,并通过计算实例验证了算法在面对复杂介质时的稳定性和有效性. 相似文献
12.
Amplitude versus offset information is a key feature to seismic reservoir characterization. Therefore amplitude preserving migration was developed to obtain this information from seismic reflection data. For complex 3-D media, however, this process is computationally expensive. In this paper we present an efficient traveltime based strategy for amplitude preserving migration of the Kirchhoff type. Its foundations are the generation of traveltime tables using a wavefront-oriented ray-tracing technique, and a generalized moveout relation for 3-D heterogeneous media. All required quantities for the amplitude preserving migration are computed from coarsely gridded traveltime tables. The migration includes the interpolation from the coarsely gridded input traveltimes onto the fine migration grid, the computation of amplitude preserving weight functions, and, optionally, the evaluation of an optimized migration aperture. Since ray tracing is employed for the traveltime computation the input velocity model needs to be smooth, i.e. velocity variations of spatial dimensions below the wavelength of the considered reflection signals are removed. Numerical examples on simple generic models validate the technique and an application to the Marmousi model demonstrates its potential to complex media. The major advantage of the traveltime based strategy consists of its computational efficiency by maintaining sufficient accuracy. Considerable savings in storage space (105 and more for 3-D data with respect to no interpolation at all) can be achieved. The computational time for the stack can be substantially reduced (up to 90% in 3-D) with the optimized migration aperture since only those traces are stacked which really contribute to the image point under consideration. 相似文献
13.
14.
15.
To carry out a 3D prestack migration of the Kirchhoff type is still a task of enormous computational effort. Its efficiency can be significantly enhanced by employing a fast traveltime interpolation algorithm. High accuracy can be achieved if secondorder spatial derivatives of traveltimes are included in order to account for the curvature of the wavefront. We suggest a hyperbolic traveltime interpolation scheme that permits the determination of the hyperbolic coefficients directly from traveltimes sampled on a coarse grid, thus reducing the requirements in data storage. This approach is closely related to the paraxial ray approximation and corresponds to an extension of the wellknown method to arbitrary heterogeneous and complex media in 3D. Application to various velocity models, including a 3D version of the Marmousi model, confirms the superiority of our method over the popular trilinear interpolation. This is especially true for regions with strong curvature of the local wavefront. In contrast to trilinear interpolation, our method also provides the possibility of interpolating source positions, and it is 56 times faster than the calculation of traveltime tables using a fast finitedifference eikonal solver. 相似文献
16.
Traveltime computation by wavefront-orientated ray tracing 总被引：1，自引：0，他引：1
For multivalued traveltime computation on dense grids, we propose a wavefront‐orientated ray‐tracing (WRT) technique. At the source, we start with a few rays which are propagated stepwise through a smooth two‐dimensional (2D) velocity model. The ray field is examined at wavefronts and a new ray might be inserted between two adjacent rays if one of the following criteria is satisfied: (1) the distance between the two rays is larger than a predefined threshold; (2) the difference in wavefront curvature between the rays is larger than a predefined threshold; (3) the adjacent rays intersect. The last two criteria may lead to oversampling by rays in caustic regions. To avoid this oversampling, we do not insert a ray if the distance between adjacent rays is smaller than a predefined threshold. We insert the new ray by tracing it from the source. This approach leads to an improved accuracy compared with the insertion of a new ray by interpolation, which is the method usually applied in wavefront construction. The traveltimes computed along the rays are used for the estimation of traveltimes on a rectangular grid. This estimation is carried out within a region bounded by adjacent wavefronts and rays. As for the insertion criterion, we consider the wavefront curvature and extrapolate the traveltimes, up to the second order, from the intersection points between rays and wavefronts to a gridpoint. The extrapolated values are weighted with respect to the distances to wavefronts and rays. Because dynamic ray tracing is not applied, we approximate the wavefront curvature at a given point using the slowness vector at this point and an adjacent point on the same wavefront. The efficiency of the WRT technique is strongly dependent on the input parameters which control the wavefront and ray densities. On the basis of traveltimes computed in a smoothed Marmousi model, we analyse these dependences and suggest some rules for a correct choice of input parameters. With suitable input parameters, the WRT technique allows an accurate traveltime computation using a small number of rays and wavefronts. 相似文献