共查询到20条相似文献，搜索用时 15 毫秒
1.
提出直接在序率域内用Walsh变换实现引力场球谐综合的问题。给出球谐函数展开式的Walsh变换及快速算法,讨论了Walsh变换和Walsh-Fourier变换、Fourier变换之间的差异,分析了用地球重力场模型OSU81的位系数作出的Walsh变换和Fourier变换的结果。研究表明:Walsh变换与Walsh-Fourier变换、Fourier变换对应向量在数量方面的差值通常都小于士10~(-5);对于给定的阶数和飞行高度,3种方法求得的球谐综合值总是完全一致的;1°×1°等网格数据和Walsh函数形状相近。在重力场研究中Walsh级数会比Fourier级数收敛得更快;Walsh变换在计算速度、计算准确度、数据储存、收敛速度和方法简单方面都好于Fourier变换。 相似文献
2.
借助Walsh变换实现引力位球谐函数的快速Fourier变换导出了球谐函数的Walsh-Fourier变换、转换矩阵的快速Walsh-Hadamard变换算法及其数据压缩方法还讨论了Walsh-Fouriede换的特性及其在球谐分析中的应用研究表明：当序率和频率等同时．Walsh．Fourier变换和Fourier变换的结果完全一致,两者曲线形态相同;按双精度运算,两种方法的计算准确度均可达到±（10－15-10－14）;Walsh－Fourler变换可以用实数变换取代Fourier变换的复数变换;快速Walsh－Hadamard变换速度提高的幅度将随着阶数的增加而递增：Walsh-Fourier变换可以用于序率和频率等同或不等同的情形Walsh-Fourler变换可在计算精度、数据压缩和位场谱表示方面好于Fourier变换 相似文献
3.
不规则采样地震数据的重建是地震数据分析处理的重要问题.本文给出了一种基于非均匀快速傅里叶变换的最小二乘反演地震数据重建的方法,在最小二乘反演插值方程中,引入正则化功率谱约束项,通过非均匀快速傅里叶变换和修改周期图的方式,自适应迭代修改约束项,使待插值数据的频谱越来越接近真实的频谱,采用预条件共轭梯度法迭代求解,保证了解的稳定性和收敛速度.理论模型和实际地震数据插值试验证明了本文方法能够去除空间假频,速度快、插值效果好,具有实用价值. 相似文献
4.
An efficient algorithm is presented to compute the Hankel transform. The algorithm yields simultaneously all the required weights for a given order of the Bessel function using the fast Fourier transform. An additional shift is introduced to the filter abscissa besides Koefoed's shift to give a better filter performance. 相似文献
5.
The hyperbolic Radon transform has a long history of applications in seismic data processing because of its ability to focus/sparsify the data in the transform domain. Recently, deconvolutive Radon transform has also been proposed with an improved time resolution which provides improved processing results. The basis functions of the (deconvolutive) Radon transform, however, are time-variant, making the classical Fourier based algorithms ineffective to carry out the required computations. A direct implementation of the associated summations in the time–space domain is also computationally expensive, thus limiting the application of the transform on large data sets. In this paper, we present a new method for fast computation of the hyperbolic (deconvolutive) Radon transform. The method is based on the recently proposed generalized Fourier slice theorem which establishes an analytic expression between the Fourier transforms associated with the data and Radon plane. This allows very fast computations of the forward and inverse transforms simply using fast Fourier transform and interpolation procedures. These canonical transforms are used within an efficient iterative method for sparse solution of (deconvolutive) Radon transform. Numerical examples from synthetic and field seismic data confirm high performance of the proposed fast algorithm for filling in the large gaps in seismic data, separating primaries from multiple reflections, and performing high-quality stretch-free stacking. 相似文献
6.
7.
Ｆｏｕｒｉｅｒ算法是求解Ｒａｄｏｎ变换的一种方法,优点是计算量小,速度快,但因其成像质量较差,所以在医疗ＣＴ方面的应用较少。本文叙述了一种改进的Ｆｏｕｒｉｅｒ算法,并对其作了成像实验,实验结果表明改进Ｆｏｕｒｉｅｒ 算法的成像质量不低于国产ＣＴ所采用的卷积反投影算法,但在速度上却有很大优势。 相似文献
8.
A Fourier transform approach is applied to the transient analysis of dynamic soil–structure interaction under SH-motion. The governing equations are formulated in the frequency domain using a Finite Element–Boundary Element (FE–BE) coupling method. After solving the transformed problem, the transient solution is obtained using the discrete inverse Fourier transform with a fast Fourier transform algorithm. Two examples are presented in order to show the numerical performance of the proposed technique. 相似文献
9.
Leyuan Wu 《Surveys in Geophysics》2018,39(3):401-434
We present a brief review of gravity forward algorithms in Cartesian coordinate system, including both space-domain and Fourier-domain approaches, after which we introduce a truly general and efficient algorithm, namely the convolution-type Gauss fast Fourier transform (Conv-Gauss-FFT) algorithm, for 2D and 3D modeling of gravity potential and its derivatives due to sources with arbitrary geometry and arbitrary density distribution which are defined either by discrete or by continuous functions. The Conv-Gauss-FFT algorithm is based on the combined use of a hybrid rectangle-Gaussian grid and the fast Fourier transform (FFT) algorithm. Since the gravity forward problem in Cartesian coordinate system can be expressed as continuous convolution-type integrals, we first approximate the continuous convolution by a weighted sum of a series of shifted discrete convolutions, and then each shifted discrete convolution, which is essentially a Toeplitz system, is calculated efficiently and accurately by combining circulant embedding with the FFT algorithm. Synthetic and real model tests show that the Conv-Gauss-FFT algorithm can obtain high-precision forward results very efficiently for almost any practical model, and it works especially well for complex 3D models when gravity fields on large 3D regular grids are needed. 相似文献
10.
Prabhakar S. Naidu 《Pure and Applied Geophysics》1970,81(1):17-25
Summary
Cooley andTukey's fast Fourier transform algorithm for two dimensional complex data has been modified so as to reduce the storage space and computation time to half. The modified version has enabled us to Fourier transform aeromagnetic field over twice the area that could be covered by the original method. From the Fourier transform we computed radial spectrum, which could be approximated by three straight line segments whose slopes are related to the depths of the various magnetic layers. The computed depths are: 1090', 2600', and 7200'. 相似文献
11.
1942年,Hartley在傅立叶变换基础上进行改进,提出Hartley变换,Hartley变换(HT)是一种实数域内的变换,比傅立叶变换(FT)至少减少一半的空间和时间.本文介绍了Hartley变换在地震波研究中的应用,包括强震数据转换、地震动模拟中的变换问题,举例说明了Hartley变换在节约计算空间和提高计算效率上的优越性. 相似文献
12.
非规则采样快速傅里叶变换（NFFT）主要用于快速计算非规则采样数据的频谱及重建.该方法为非规则采样数据频谱重建技术的核心算法.在实现NFFT算法时,高速度和高精度计算是其应用的前提和关键.本文针对二维NFFT计算效率,应用表驱动思路进行改进,将Gauss褶积算子由矩形改进为椭圆以减少计算量,将e指数计算改进为乘法以加快计算速度,并建表解决NFFT算法在地震资料处理中的应用问题.本文同时给出了非规则采样地震数据NFFT谱重建方法.最后本文给出算例验证提出方法的计算速度和精度,和非规则采样地震资料重建结果. 相似文献
13.
为提高水平层状介质中三维电磁波散射和逆散射数值模拟的效率,在对角张量近似(DTA)的基础上根据不同回代方式得到了求解积分方程的DTA1和DTA2两种近似. 这两种近似可以作为计算积分方程稳定型双共轭梯度快速Fourier变换(BCGS-FFT)算法的初始猜测值和预条件因子,从而形成效率更高的混合DTA-BCGS算法. 散射实例说明了DTA2的高精度和混合DTA-BCGS算法尤其是混合DTA2-BCGS算法的高效率. 由于DTA2近似程度更高,将DTA2与变型Born迭代反演方法(DBIM)相结合形成了一种对三维异常体进行重构的快速电磁波逆散射技术. 文中的逆散射实例说明所开发的逆散射技术对重构水平层状介质中的任意三维异常体是非常有效的. 相似文献
14.
PRABHAKAR S. NAIDU 《Geophysical Prospecting》1969,17(3):344-361
An efficient method of computing spectrum and cross-spectrum of large scale aero-magnetic field (or of any other two-dimensional field) has been developed and programmed for a digital computer. The method uses fast Fourier transform techniques. Briefly, the method is as follows: a digitized aeromagnetic map is divided into a number of rectangular blocks. Fourier transforms of these blocks are computed using a two-dimensional fast Fourier transform method. Finally, the amplitude of the Fourier transforms is averaged to give the desired spectrum. Computation of cross-spectrum follows the same lines. In fact, the same programme may be used to a compute the spectrum as well as cross-spectrum. The method has a number of computational advantages, in particular it reduces greatly computational time and storage requirements. The programme has been tested on synthetic data as well as on real aeromagnetic data. It took less than 30 seconds on an IBM 360/50 computer to compute the spectrum of an aeromagnetic map covering an area of approximately 4500 square miles. 相似文献
15.
16.
An analysis of a recent modified frequency-domain procedure for computing the response of linear systems using the fast Fourier transform (FFT) algorithm is described. This modified procedure eliminates the appended free-vibration interval that is used in the standard approach. The duration of the period of computation still needs to be longer than that of the response interval of interest, but only slightly. Reducing the period of computation lowers the number of frequencies at which the transfer function needs to be defined. The major drawback of the method is a high sensitivity to errors in the computed values of the transfer function, which reduces the role of interpolation in the transfer function definition. The modified method is related to the discrete Laplace transform. 相似文献
17.
《Advances in water resources》1998,21(5):385-399
It is often convenient to use synthetically generated random fields to study the hydrologic effects of spatial heterogeneity. Although there are many ways to produce such fields, spectral techniques are particularly attractive because they are fast and conceptually straightforward. This paper describes a spectral algorithm for generating sets of random fields which are correlated with one another. The algorithm is based on a discrete version of the Fourier-Stieltjes representation for multidimensional random fields. The Fourier increment used in this representation depends on a random phase angle process and a complex-valued spectral factor matrix which can be readily derived from a specified set of cross-spectral densities (or cross-covariances). The inverse Fourier transform of the Fourier increment is a complex random field with real and imaginary parts which each have the desired coveriance structure. Our complex-valued spectral formulation provides an especially convenient way to generate a set of random fields which all depend on a single underlying (independent) field, provided that the fields in question can be related by space-invariant linear transformations. We illustrate this by generating multi-dimensional mass conservative groundwater velocity fields which can be used to simulate solute transport through heterogeneous anisotropic porous media. 相似文献
18.
GPS观测环境愈来愈复杂,动态观测值包含的影响因素较多,函数关系复杂,影响特征信息的提取和参数模型的解释能力.小波包具有良好的时频分析能力,利用小波包理论对GPS数据序列进行分解与重构过程中有三个基本运算：与小波滤波器卷积、隔点采样、隔点插零,该三项运算产生频率交错和频率折叠等频率混淆现象.为消除频率混淆现象,分解与重构时,每作一次信号与小波卷积后,将其结果作一次快速傅立叶变换,频谱中多余的频率成分的谱值置零,再对置零后的频谱进行傅立叶逆变换,然后继续进行小波包的分解与重构,从而实现单子带重构提取GPS数据序列特征项.通过实例验证了小波包单子带重构提取GPS特征信息的有效性. 相似文献
19.
Hua Zhang Su Diao Wei Chen Guangnan Huang Hongxing Li Min Bai 《Geophysical Prospecting》2019,67(5):1201-1218
Seismic data reconstruction, as a preconditioning process, is critical to the performance of subsequent data and imaging processing tasks. Often, seismic data are sparsely and non-uniformly sampled due to limitations of economic costs and field conditions. However, most reconstruction processing algorithms are designed for the ideal case of uniformly sampled data. In this paper, we propose the non-equispaced fast discrete curvelet transform-based three-dimensional reconstruction method that can handle and interpolate non-uniformly sampled data effectively along two spatial coordinates. In the procedure, the three-dimensional seismic data sets are organized in a sequence of two-dimensional time slices along the source–receiver domain. By introducing the two-dimensional non-equispaced fast Fourier transform in the conventional fast discrete curvelet transform, we formulate an L1 sparsity regularized problem to invert for the uniformly sampled curvelet coefficients from the non-uniformly sampled data. In order to improve the inversion algorithm efficiency, we employ the linearized Bregman method to solve the L1-norm minimization problem. Once the uniform curvelet coefficients are obtained, uniformly sampled three-dimensional seismic data can be reconstructed via the conventional inverse curvelet transform. The reconstructed results using both synthetic and real data demonstrate that the proposed method can reconstruct not only non-uniformly sampled and aliased data with missing traces, but also the subset of observed data on a non-uniform grid to a specified uniform grid along two spatial coordinates. Also, the results show that the simple linearized Bregman method is superior to the complex spectral projected gradient for L1 norm method in terms of reconstruction accuracy. 相似文献
20.
Improving seismic resolution is essential for obtaining more detailed structural and stratigraphic information. We present a new algorithm to increase seismic resolution with a minimum of user‐defined parameters. The algorithm inherits useful properties of both the short‐time Fourier transform and the cepstrum to smooth and broaden the frequency spectrum at each translation of the spectral decomposing window. The key idea is to replace the amplitude spectrum with its logarithm in each window of the short‐time Fourier transform. We describe the mathematical formulation of the algorithm and its testing on synthetic and real seismic data to obtain broader frequency spectra and thus enhance the seismic resolution. 相似文献