Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives
DOI10.1016/J.CAM.2011.06.027zbMATH Open1236.65158OpenAlexW2022800596MaRDI QIDQ645708FDOQ645708
Authors: Takemitsu Hasegawa, Hiroshi Sugiura 
Publication date: 10 November 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.027
Recommendations
- On approximating the finite Hilbert transform and applications in numerical integration
- Uniform approximation to finite Hilbert transform of oscillatory functions and its algorithm
- Approximating the finite Hilbert transform for absolutely continuous mappings and applications in numerical integration
- A note on approximating finite Hilbert transform and quadrature formula
- scientific article; zbMATH DE number 1098920
- Approximating the finite Hilbert transform via Simpson type inequalities and applications
- Investigations on the approximability and computability of the Hilbert transform with applications
- scientific article; zbMATH DE number 2068381
- A stable and convergent algorithm to evaluate Hilbert transform
- Numerical approximations of highly oscillatory Hilbert transforms
numerical examplesalgorithmquadrature ruleHilbert transformChebyshev interpolationCauchy principal value integralend-point singularities of Jacobi typeHadamard finite-part integralshyper-singular integrals
Numerical quadrature and cubature formulas (65D32) Approximate quadratures (41A55) Numerical methods for integral transforms (65R10) Special integral transforms (Legendre, Hilbert, etc.) (44A15)
Cites Work
- Title not available (Why is that?)
- Numerical evaluation of hypersingular integrals
- Uniform approximations to finite Hilbert transform and its derivative.
- Fast construction of the Fejér and Clenshaw-Curtis quadrature rules
- On the Uniform Convergence of Gaussian Quadrature Rules for Cauchy Principal Value Integrals and Their Derivatives
- Title not available (Why is that?)
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- A method for numerical integration on an automatic computer
- Error Bounds for Gaussian Quadrature of Analytic Functions
- Title not available (Why is that?)
- Hilbert and Hadamard transforms by generalized Chebyshev expansion
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- An Automatic Quadrature for Cauchy Principal Value Integrals
- Numerical Solution of Sigular Integral Equations Using Gauss-type Formulae I
- The numerical evaluation of Hadamard finite-part integrals
- Truncation Errors in Two Chebyshev Series Approximations
- Computing the Hilbert transform of a Jacobi weight function
- Generalized Chebyshev Interpolation and Its Application to Automatic Quadrature
- A new algorithm for Cauchy principal value and Hadamard finite-part integrals
Cited In (6)
- Title not available (Why is that?)
- Approximating the finite Hilbert transform via some companions of Ostrowski's inequalities
- Two new formulas for the numerical evaluation of the Hilbert transform
- The practical Gauss type rules for Hadamard finite-part integrals using Puiseux expansions
- Uniform approximation to finite Hilbert transform of oscillatory functions and its algorithm
- Computing the Hilbert transform of a Jacobi weight function
Uses Software
This page was built for publication: Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645708)
