A sinc quadrature rule for Hadamard finite-part integral
Numerische Mathematik
Hilbert and Hadamard transforms by generalized Chebyshev expansion
Journal of Computational and Applied Mathematics
Numerical evaluation of hypersingular integrals
ICCAM'92 Proceedings of the fifth international conference on Computational and applied mathematics
Three algorithms for Hadamard finite-part integrals and fractional derivatives
Journal of Computational and Applied Mathematics
A new algorithm for Cauchy principal value and Hadamard finite-part integrals
Journal of Computational and Applied Mathematics
A method for the practical evaluation of the Hilbert transform on the real line
Journal of Computational and Applied Mathematics - Numerical evaluation of integrals
Implementing Clenshaw-Curtis quadrature, II computing the cosine transformation
Communications of the ACM
Journal of Computational and Applied Mathematics
The superconvergence of the composite midpoint rule for the finite-part integral
Journal of Computational and Applied Mathematics
Superconvergence and ultraconvergence of Newton-Cotes rules for supersingular integrals
Journal of Computational and Applied Mathematics
Quadrature rules with multiple nodes for evaluating integrals with strong singularities
Journal of Computational and Applied Mathematics
The superconvergence of the Newton-Cotes rule for Cauchy principal value integrals
Journal of Computational and Applied Mathematics
On computing with the Hilbert spline transform
Advances in Computational Mathematics
Hi-index | 0.00 |
Interpolatory integration rules of numerical stability are presented for approximating Cauchy principal value (p.v.) integrals ∫-11 f(t)/(t-c) dt and Hadamard finite part (f.p.) integrals ∫-11f(t)/(t - c)2 dt, -1 c f(t). Present quadrature rules consist of interpolating f(t) at abscissae in the interval of integration [-1, 1] except for the pole c, where neither the function value f(c) nor its derivative f'(c) is required, followed by subtracting out the singularities.We demonstrate that the use of both endpoints ±1 as abscissae in interpolating f(t) is essential for uniformly approximating the integrals, namely for bounding the approximation errors independently of the values of c. In fact, for the f.p. integrals the use of double abscissae at both endpoints ±1 as well as simple abscissae in (-1, 1) enables the uniform approximations, while the use of simple abscissae at both endpoints ±1 and those in (-1, 1) is sufficient for the p.v. integrals. These facts suggest that finite Hilbert transforms (p.v. integrals) and their derivatives (f.p. integrals) with varied values of c could be approximated efficiently with the same number of abscissae, respectively. Some numerical examples are given.