One of the solution techniques used for ordinary differential equations, partial and integral equations is the Elzaki Transform. This paper is an extension of Mamadu and Njoseh [1] numerical procedure (Elzaki transfor...One of the solution techniques used for ordinary differential equations, partial and integral equations is the Elzaki Transform. This paper is an extension of Mamadu and Njoseh [1] numerical procedure (Elzaki transform method (ETM)) for computing delay differential equations (DDEs). Here, a reconstructed Elzaki transform method (RETM) is proposed for the solution of DDEs where Mamadu-Njoseh polynomials are applied as basis functions in the approximation of the analytic solution. Using this strategy, a numerical illustration as in Ref.[1] is provided to the RETM as a basis for comparison to guarantee accuracy and consistency of the method. All numerical computations were performed with MAPLE 18 software.展开更多
Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find on approximation to f(t) by the use of the dassical Jacobi polynomials. The main contribution of our work is the development of a...Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find on approximation to f(t) by the use of the dassical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series ex-pansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.展开更多
We propose a novel method for seismic noise attenuation by applying nonstationary polynomial fitting （NPF）, which can estimate coherent components with amplitude variation along the event. The NPF with time-varying ...We propose a novel method for seismic noise attenuation by applying nonstationary polynomial fitting （NPF）, which can estimate coherent components with amplitude variation along the event. The NPF with time-varying coefficients can adaptively estimate the coherent components. The smoothness of the polynomial coefficients is controlled by shaping regularization. The signal is coherent along the offset axis in a common midpoint （CMP） gather after normal moveout （NMO）. We use NPF to estimate the effective signal and thereby to attenuate the random noise. For radial events-like noise such as ground roll, we first employ a radial trace （RT） transform to transform the data to the time-velocity domain. Then the NPF is used to estimate coherent noise in the RT domain. Finally, the coherent noise is adaptively subtracted from the noisy dataset. The proposed method can effectively estimate coherent noise with amplitude variations along the event and there is no need to propose that noise amplitude is constant. Results of synthetic and field data examples show that, compared with conventional methods such as stationary polynomial fitting and low cut filters, the proposed method can effectively suppress seismic noise and preserve the signals.展开更多
In this paper, we apply the binary Bell polynomial approach to high-dimensional variable-coefficient nonlinear evolution equations. Taking the generalized （2＋1）-dimensional KdV equation with variable coefficients a...In this paper, we apply the binary Bell polynomial approach to high-dimensional variable-coefficient nonlinear evolution equations. Taking the generalized （2＋1）-dimensional KdV equation with variable coefficients as an illustrative example, the bilinear formulism, the bilinear Backlund transformation and the Lax pair are obtained in a quick and natural manner. Moreover, the infinite conservation laws are also derived.展开更多
A new application of Chebyshev polynomials of second kind Un(x) to functions of two-dimensional operators is derived and discussed. It is related to the Hamilton-Cayley identity for operators or matrices which allows ...A new application of Chebyshev polynomials of second kind Un(x) to functions of two-dimensional operators is derived and discussed. It is related to the Hamilton-Cayley identity for operators or matrices which allows to reduce powers and smooth functions of them to superpositions of the first N-1 powers of the considered operator in N-dimensional case. The method leads in two-dimensional case first to the recurrence relations for Chebyshev polynomials and due to initial conditions to the application of Chebyshev polynomials of second kind Un(x). Furthermore, a new general class of Generating functions for Chebyshev polynomials of first and second kind Un(x) comprising the known Generating function as special cases is constructed by means of a derived identity for operator functions f(A) of a general two-dimensional operator A. The basic results are Formulas (9.5) and (9.6) which are then specialized for different examples of functions f(x). The generalization of the theory for three-dimensional operators is started to attack and a partial problem connected with the eigenvalue problem and the Hamilton-Cayley identity is solved in an Appendix. A physical application of Chebyshev polynomials to a problem of relativistic kinematics of a uniformly accelerated system is solved. All operator calculations are made in coordinate-invariant form.展开更多
It is shown that the polynomials based image registration, which is widely used in remote sensing field, does not have a sound mathematical basis. In fact, there seems no theoretical basis for the polynomials based tr...It is shown that the polynomials based image registration, which is widely used in remote sensing field, does not have a sound mathematical basis. In fact, there seems no theoretical basis for the polynomials based transform to outperform the affine transformation, a much simpler one,in image registration. If the transformation functions are polynomials of order n, the corresponding scene is shown to be in general the intersection of two curved surfaces of order n + 1, in other words,a space curve. In some special cases, the scene is approaching to a plane. To our knowledge, such results did not appear in the literature previously.展开更多
The optimal condition and its geometrical characters of the least square adjustment were proposed. Then the relation between the transformed surface and least squares was discussed. Based on the above, a non iterative...The optimal condition and its geometrical characters of the least square adjustment were proposed. Then the relation between the transformed surface and least squares was discussed. Based on the above, a non iterative method, called the fitting method of pseudo polynomial, was derived in detail. The final least squares solution can be determined with sufficient accuracy in a single step and is not attained by moving the initial point in the view of iteration. The accuracy of the solution relys wholly on the frequency of Taylor’s series. The example verifies the correctness and validness of the method. [展开更多
In this paper, we lower the upper bound of the number of solutions of oracletransformation polynomial F(x) over GF(q) So one can also recover all the secrete keys with fewercalls We use our generalized ' even-and-...In this paper, we lower the upper bound of the number of solutions of oracletransformation polynomial F(x) over GF(q) So one can also recover all the secrete keys with fewercalls We use our generalized ' even-and-odd test' method to recover the least significant p-adic'bits' of representations of the Lucas Cryptosystem secret keys x Finally, we analyze the EfficientCompact Subgroup Trace Representation (XTR) Diffic-Hellmen secrete keys and point out that if theorder of XIR-subgroup has a specialform then all the bits of the secrete key of XIR ean be recoveredform any bit of the exponent x.展开更多
We investigate the extended （2＋ 1）-dimensional shaUow water wave equation. The binary Bell polynomials are used to construct bilinear equation, bilinear Backlund transformation, Lax pair, and Darboux covariant Lax ...We investigate the extended （2＋ 1）-dimensional shaUow water wave equation. The binary Bell polynomials are used to construct bilinear equation, bilinear Backlund transformation, Lax pair, and Darboux covariant Lax pair for this equation. Moreover, the infinite conservation laws of this equation are found by using its Lax pair. All conserved densities and fluxes are given with explicit recursion formulas. The N-soliton solutions are also presented by means of the Hirota bilinear method.展开更多
Extension Principles play a significant role in the construction of MRA based wavelet frames and have attracted much attention for their potential applications in various scientific fields. A novel and simple procedur...Extension Principles play a significant role in the construction of MRA based wavelet frames and have attracted much attention for their potential applications in various scientific fields. A novel and simple procedure for the construction of tight wavelet frames generated by the Walsh polynomials using Extension Principles was recently considered by Shah in [Tight wavelet frames generated by the Walsh poly- nomials, Int. J. Wavelets, Multiresolut. Inf. Process., 11（6） （2013）, 1350042]. In this paper, we establish a complete characterization of tight wavelet frames generated by the Walsh polynomials in terms of the polyphase matrices formed by the polyphase components of the Walsh polynomials.展开更多
It is well known that the Cayley-Hamilton theorem is an interesting and important theorem in linear algebras, which was first explicitly stated by A. Cayley and W. R. Hamilton about in 1858, but the first general proo...It is well known that the Cayley-Hamilton theorem is an interesting and important theorem in linear algebras, which was first explicitly stated by A. Cayley and W. R. Hamilton about in 1858, but the first general proof was published in 1878 by G. Frobenius, and numerous others have appeared since then, for example see [1,2]. From the structure theorem for finitely generated modules over a principal ideal domain it straightforwardly follows the Cayley-Hamilton theorem and the proposition that there exists a vector v in a finite dimensional linear space V such that and a linear transformation of V have the same minimal polynomial. In this note, we provide alternative proofs of these results by only utilizing the knowledge of linear algebras.展开更多
The boundary value problem with a spectral parameter in the boundary conditions for a polynomial pencil of the Sturm-Liouville operator is investigated. Using the properties of the transformation operators for such op...The boundary value problem with a spectral parameter in the boundary conditions for a polynomial pencil of the Sturm-Liouville operator is investigated. Using the properties of the transformation operators for such operators, the asymptotic formulas for eigenvalues of the boundary value problem are obtained.展开更多
Discrete polynomials have wide applications in various technical fields. This paper considers a family of binomial polynomials which consists of tow binomial factors. From this the binomial-type matrix is derived and ...Discrete polynomials have wide applications in various technical fields. This paper considers a family of binomial polynomials which consists of tow binomial factors. From this the binomial-type matrix is derived and its some interesting properties are stated and discussed. Then a new discrete transform is defined for data conversions. The paper concludes with applications of the transform in falter design.展开更多
Binary Bell Polynomials play an important role in the characterization of bilinear equation. The bilinear form, bilinear B?cklund transformation and Lax pairs for the modified Kadomtsev-Petviashvili equation are deriv...Binary Bell Polynomials play an important role in the characterization of bilinear equation. The bilinear form, bilinear B?cklund transformation and Lax pairs for the modified Kadomtsev-Petviashvili equation are derived from the Binary Bell Polynomials.展开更多
基于Transformer的大语言模型(Large Language Models,LLM)和视觉Transformer(Vision Transformers,ViTs)分别在自然语言处理、机器视觉任务上实现了最为先进的性能.但是ViTs和LLM的常用激活函数GELU(Gaussian Error Linear Unit)、Swis...基于Transformer的大语言模型(Large Language Models,LLM)和视觉Transformer(Vision Transformers,ViTs)分别在自然语言处理、机器视觉任务上实现了最为先进的性能.但是ViTs和LLM的常用激活函数GELU(Gaussian Error Linear Unit)、Swish在Transformer全量化推理中存在精度不足、计算效率低的问题,限制了它们在资源受限的边缘端设备上的部署和应用.本文提出了一种基于分段二次多项式拟合的激活函数高精度近似计算方法(Segmented Quadratic Polynomial Fitting,SQPF)及其量化推理过程,以实现端侧非线性激活函数的高性能部署.SQPF采用最小二乘法和粒子群优化方法求解非线性激活函数拟合优化问题,给出最优的二次多项式拟合系数和区间划分.得到的二次多项式拟合采用动态精度定点对称量化方法进行纯整数推理,推理过程仅包含移位操作和乘加运算.本文使用SQPF计算了GELU和Swish的二次多项式拟合Si-GELU和Si-Swish,并评估了量化推理精度.实验结果表明,在标准数据集ImageNet上,Si-GELU引起的ViTs(ViT、DeiT和Swin)模型分类任务准确率衰减仅为0.09%,是其他同类方法的27.3%;在主流的大语言模型评测数据集MMLU上,Si-Swish引起的子类别精度衰减不超过0.77%,大类别精度衰减不超过0.23%.极小的精度损失表明SQPF计算得到的最优分段二次多项式拟合可以直接替换Transformer模型中全精度浮点激活函数,不必进行参数微调或者重训练.展开更多
为了提高锂离子电池健康状态(state of health,SOH)估计的精确度,本研究结合卷积神经网络(convolutional neural networks,CNN)强大的局部特征提取能力和Transformer的序列处理能力,提出了基于多项式特征扩展的CNN-Transformer融合模型...为了提高锂离子电池健康状态(state of health,SOH)估计的精确度,本研究结合卷积神经网络(convolutional neural networks,CNN)强大的局部特征提取能力和Transformer的序列处理能力,提出了基于多项式特征扩展的CNN-Transformer融合模型。该方法提取了与电池容量高度相关的增量容量(incremental capacity,IC)曲线峰值、IC曲线对应电压、面积及充电时间作为健康因子,然后将其进行多项式扩展,增加融合模型对输入特征的非线性处理能力。引入主成分分析法(principal component analysis,PCA)对特征空间进行降维,有利于捕获数据有效信息,减少模型训练时间。采用美国国家宇航局(National Aeronautics and Space Administration,NASA)数据集和马里兰大学数据集,通过加入多项式特征前后的CNN-Transformer模型对比、加入多项式特征的CNN-Transformer模型和单一模型算法对比,验证了加入多项式特征的CNN-Transformer融合算法的有效性和精确度,结果表明提出模型的SOH估计精度相较于未加入多项式特征的CNN-Transformer模型,对于B0005、B0006、B0007、B0018数据集分别提高了38.71%、50.28%、4.71%、17.58%。展开更多
In seismic data processing, random noise seriously affects the seismic data quality and subsequently the interpretation. This study aims to increase the signal-to-noise ratio by suppressing random noise and improve th...In seismic data processing, random noise seriously affects the seismic data quality and subsequently the interpretation. This study aims to increase the signal-to-noise ratio by suppressing random noise and improve the accuracy of seismic data interpretation without losing useful information. Hence, we propose a structure-oriented polynomial fitting filter. At the core of structure-oriented filtering is the characterization of the structural trend and the realization of nonstationary filtering. First, we analyze the relation of the frequency response between two-dimensional（2D） derivatives and the 2D Hilbert transform. Then, we derive the noniterative seismic local dip operator using the 2D Hilbert transform to obtain the structural trend. Second, we select polynomial fitting as the nonstationary filtering method and expand the application range of the nonstationary polynomial fitting. Finally, we apply variableamplitude polynomial fitting along the direction of the dip to improve the adaptive structureoriented filtering. Model and field seismic data show that the proposed method suppresses the seismic noise while protecting structural information.展开更多
文摘One of the solution techniques used for ordinary differential equations, partial and integral equations is the Elzaki Transform. This paper is an extension of Mamadu and Njoseh [1] numerical procedure (Elzaki transform method (ETM)) for computing delay differential equations (DDEs). Here, a reconstructed Elzaki transform method (RETM) is proposed for the solution of DDEs where Mamadu-Njoseh polynomials are applied as basis functions in the approximation of the analytic solution. Using this strategy, a numerical illustration as in Ref.[1] is provided to the RETM as a basis for comparison to guarantee accuracy and consistency of the method. All numerical computations were performed with MAPLE 18 software.
文摘Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find on approximation to f(t) by the use of the dassical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series ex-pansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.
基金supported by the National Basic Research Program of China (973 program, grant 2007CB209606) the National High Technology Research and Development Program of China (863 program, grant 2006AA09A102-09)
文摘We propose a novel method for seismic noise attenuation by applying nonstationary polynomial fitting （NPF）, which can estimate coherent components with amplitude variation along the event. The NPF with time-varying coefficients can adaptively estimate the coherent components. The smoothness of the polynomial coefficients is controlled by shaping regularization. The signal is coherent along the offset axis in a common midpoint （CMP） gather after normal moveout （NMO）. We use NPF to estimate the effective signal and thereby to attenuate the random noise. For radial events-like noise such as ground roll, we first employ a radial trace （RT） transform to transform the data to the time-velocity domain. Then the NPF is used to estimate coherent noise in the RT domain. Finally, the coherent noise is adaptively subtracted from the noisy dataset. The proposed method can effectively estimate coherent noise with amplitude variations along the event and there is no need to propose that noise amplitude is constant. Results of synthetic and field data examples show that, compared with conventional methods such as stationary polynomial fitting and low cut filters, the proposed method can effectively suppress seismic noise and preserve the signals.
基金supported by the National Natural Science Foundation of China(Grant No.10831003)the Natural Science Foundation of Zhejiang Province,China(Grant Nos.Y6100791 and R6090109)
文摘In this paper, we apply the binary Bell polynomial approach to high-dimensional variable-coefficient nonlinear evolution equations. Taking the generalized （2＋1）-dimensional KdV equation with variable coefficients as an illustrative example, the bilinear formulism, the bilinear Backlund transformation and the Lax pair are obtained in a quick and natural manner. Moreover, the infinite conservation laws are also derived.
文摘A new application of Chebyshev polynomials of second kind Un(x) to functions of two-dimensional operators is derived and discussed. It is related to the Hamilton-Cayley identity for operators or matrices which allows to reduce powers and smooth functions of them to superpositions of the first N-1 powers of the considered operator in N-dimensional case. The method leads in two-dimensional case first to the recurrence relations for Chebyshev polynomials and due to initial conditions to the application of Chebyshev polynomials of second kind Un(x). Furthermore, a new general class of Generating functions for Chebyshev polynomials of first and second kind Un(x) comprising the known Generating function as special cases is constructed by means of a derived identity for operator functions f(A) of a general two-dimensional operator A. The basic results are Formulas (9.5) and (9.6) which are then specialized for different examples of functions f(x). The generalization of the theory for three-dimensional operators is started to attack and a partial problem connected with the eigenvalue problem and the Hamilton-Cayley identity is solved in an Appendix. A physical application of Chebyshev polynomials to a problem of relativistic kinematics of a uniformly accelerated system is solved. All operator calculations are made in coordinate-invariant form.
基金Supported by National Natural Science Foundation of P. R. China (60175009, 60121302) Corresponding author:Hu Zhan-Yi
文摘It is shown that the polynomials based image registration, which is widely used in remote sensing field, does not have a sound mathematical basis. In fact, there seems no theoretical basis for the polynomials based transform to outperform the affine transformation, a much simpler one,in image registration. If the transformation functions are polynomials of order n, the corresponding scene is shown to be in general the intersection of two curved surfaces of order n + 1, in other words,a space curve. In some special cases, the scene is approaching to a plane. To our knowledge, such results did not appear in the literature previously.
文摘The optimal condition and its geometrical characters of the least square adjustment were proposed. Then the relation between the transformed surface and least squares was discussed. Based on the above, a non iterative method, called the fitting method of pseudo polynomial, was derived in detail. The final least squares solution can be determined with sufficient accuracy in a single step and is not attained by moving the initial point in the view of iteration. The accuracy of the solution relys wholly on the frequency of Taylor’s series. The example verifies the correctness and validness of the method. [
文摘In this paper, we lower the upper bound of the number of solutions of oracletransformation polynomial F(x) over GF(q) So one can also recover all the secrete keys with fewercalls We use our generalized ' even-and-odd test' method to recover the least significant p-adic'bits' of representations of the Lucas Cryptosystem secret keys x Finally, we analyze the EfficientCompact Subgroup Trace Representation (XTR) Diffic-Hellmen secrete keys and point out that if theorder of XIR-subgroup has a specialform then all the bits of the secrete key of XIR ean be recoveredform any bit of the exponent x.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11075055 and 11275072)the Innovative Research Team Program of the National Natural Science Foundation of China (Grant No. 61021004)+1 种基金the Shanghai Knowledge Service Platform for Trustworthy Internet of Things, China(Grant No. ZF1213)the National High Technology Research and Development Program of China (Grant No. 2011AA010101)
文摘We investigate the extended （2＋ 1）-dimensional shaUow water wave equation. The binary Bell polynomials are used to construct bilinear equation, bilinear Backlund transformation, Lax pair, and Darboux covariant Lax pair for this equation. Moreover, the infinite conservation laws of this equation are found by using its Lax pair. All conserved densities and fluxes are given with explicit recursion formulas. The N-soliton solutions are also presented by means of the Hirota bilinear method.
文摘Extension Principles play a significant role in the construction of MRA based wavelet frames and have attracted much attention for their potential applications in various scientific fields. A novel and simple procedure for the construction of tight wavelet frames generated by the Walsh polynomials using Extension Principles was recently considered by Shah in [Tight wavelet frames generated by the Walsh poly- nomials, Int. J. Wavelets, Multiresolut. Inf. Process., 11（6） （2013）, 1350042]. In this paper, we establish a complete characterization of tight wavelet frames generated by the Walsh polynomials in terms of the polyphase matrices formed by the polyphase components of the Walsh polynomials.
文摘It is well known that the Cayley-Hamilton theorem is an interesting and important theorem in linear algebras, which was first explicitly stated by A. Cayley and W. R. Hamilton about in 1858, but the first general proof was published in 1878 by G. Frobenius, and numerous others have appeared since then, for example see [1,2]. From the structure theorem for finitely generated modules over a principal ideal domain it straightforwardly follows the Cayley-Hamilton theorem and the proposition that there exists a vector v in a finite dimensional linear space V such that and a linear transformation of V have the same minimal polynomial. In this note, we provide alternative proofs of these results by only utilizing the knowledge of linear algebras.
文摘The boundary value problem with a spectral parameter in the boundary conditions for a polynomial pencil of the Sturm-Liouville operator is investigated. Using the properties of the transformation operators for such operators, the asymptotic formulas for eigenvalues of the boundary value problem are obtained.
文摘Discrete polynomials have wide applications in various technical fields. This paper considers a family of binomial polynomials which consists of tow binomial factors. From this the binomial-type matrix is derived and its some interesting properties are stated and discussed. Then a new discrete transform is defined for data conversions. The paper concludes with applications of the transform in falter design.
基金supported by the National Natural Science Foundation of China(11301183).
文摘Binary Bell Polynomials play an important role in the characterization of bilinear equation. The bilinear form, bilinear B?cklund transformation and Lax pairs for the modified Kadomtsev-Petviashvili equation are derived from the Binary Bell Polynomials.
文摘基于Transformer的大语言模型(Large Language Models,LLM)和视觉Transformer(Vision Transformers,ViTs)分别在自然语言处理、机器视觉任务上实现了最为先进的性能.但是ViTs和LLM的常用激活函数GELU(Gaussian Error Linear Unit)、Swish在Transformer全量化推理中存在精度不足、计算效率低的问题,限制了它们在资源受限的边缘端设备上的部署和应用.本文提出了一种基于分段二次多项式拟合的激活函数高精度近似计算方法(Segmented Quadratic Polynomial Fitting,SQPF)及其量化推理过程,以实现端侧非线性激活函数的高性能部署.SQPF采用最小二乘法和粒子群优化方法求解非线性激活函数拟合优化问题,给出最优的二次多项式拟合系数和区间划分.得到的二次多项式拟合采用动态精度定点对称量化方法进行纯整数推理,推理过程仅包含移位操作和乘加运算.本文使用SQPF计算了GELU和Swish的二次多项式拟合Si-GELU和Si-Swish,并评估了量化推理精度.实验结果表明,在标准数据集ImageNet上,Si-GELU引起的ViTs(ViT、DeiT和Swin)模型分类任务准确率衰减仅为0.09%,是其他同类方法的27.3%;在主流的大语言模型评测数据集MMLU上,Si-Swish引起的子类别精度衰减不超过0.77%,大类别精度衰减不超过0.23%.极小的精度损失表明SQPF计算得到的最优分段二次多项式拟合可以直接替换Transformer模型中全精度浮点激活函数,不必进行参数微调或者重训练.
文摘为了提高锂离子电池健康状态(state of health,SOH)估计的精确度,本研究结合卷积神经网络(convolutional neural networks,CNN)强大的局部特征提取能力和Transformer的序列处理能力,提出了基于多项式特征扩展的CNN-Transformer融合模型。该方法提取了与电池容量高度相关的增量容量(incremental capacity,IC)曲线峰值、IC曲线对应电压、面积及充电时间作为健康因子,然后将其进行多项式扩展,增加融合模型对输入特征的非线性处理能力。引入主成分分析法(principal component analysis,PCA)对特征空间进行降维,有利于捕获数据有效信息,减少模型训练时间。采用美国国家宇航局(National Aeronautics and Space Administration,NASA)数据集和马里兰大学数据集,通过加入多项式特征前后的CNN-Transformer模型对比、加入多项式特征的CNN-Transformer模型和单一模型算法对比,验证了加入多项式特征的CNN-Transformer融合算法的有效性和精确度,结果表明提出模型的SOH估计精度相较于未加入多项式特征的CNN-Transformer模型,对于B0005、B0006、B0007、B0018数据集分别提高了38.71%、50.28%、4.71%、17.58%。
基金Research supported by the 863 Program of China(No.2012AA09A20103)the National Natural Science Foundation of China(No.41274119,No.41174080,and No.41004041)
文摘In seismic data processing, random noise seriously affects the seismic data quality and subsequently the interpretation. This study aims to increase the signal-to-noise ratio by suppressing random noise and improve the accuracy of seismic data interpretation without losing useful information. Hence, we propose a structure-oriented polynomial fitting filter. At the core of structure-oriented filtering is the characterization of the structural trend and the realization of nonstationary filtering. First, we analyze the relation of the frequency response between two-dimensional（2D） derivatives and the 2D Hilbert transform. Then, we derive the noniterative seismic local dip operator using the 2D Hilbert transform to obtain the structural trend. Second, we select polynomial fitting as the nonstationary filtering method and expand the application range of the nonstationary polynomial fitting. Finally, we apply variableamplitude polynomial fitting along the direction of the dip to improve the adaptive structureoriented filtering. Model and field seismic data show that the proposed method suppresses the seismic noise while protecting structural information.
