A stable Hankel transforms algorithm based on Haar wavelet decomposition for noisy data
From MaRDI portal
Publication:1664928
DOI10.1155/2015/191086zbMath1395.94079OpenAlexW1582241551WikidataQ59117541 ScholiaQ59117541MaRDI QIDQ1664928
Huaiqing Zhang, Chuanbao Zhu, Xiangfeng Su, Xin Nie
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/191086
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Application of orthogonal and other special functions (94A11)
Cites Work
- Unnamed Item
- Unnamed Item
- A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials
- Efficient algorithms to compute Hankel transforms using wavelets
- Numerical evaluation of the Hankel transform by using linear Legendre multi-wavelets
- Numerical solution of nonlinear Fredholm integral equations of the second kind using Haar wavelets
- An improved method for computing Hankel transform
- Numerical evaluation of the zero-order Hankel transform using Filon quadrature philosophy
- About calculation of the Hankel transform using preliminary wavelet transform
- Fast Hankel transform by fast sine and cosine transforms: the Mellin connection
- A theory for multiresolution signal decomposition: the wavelet representation
- Computation of the Hankel transform using projections
This page was built for publication: A stable Hankel transforms algorithm based on Haar wavelet decomposition for noisy data