Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives (Q645708)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives
scientific article

    Statements

    Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives (English)
    0 references
    0 references
    0 references
    10 November 2011
    0 references
    Algorithms are proposed for the numerical evaluation of Cauchy principal value integrals \[ \int^1_{-1} \{\omega(t) f(t)/(t- x)\}\,dt,\quad -1< x< 1, \] with a weight function with Jacobi type singularities \(\omega(t)= (1-t)^\alpha (1+t)^\beta\), where \(\alpha=\pm 1/2\), for a given function \(f(t)\) and Hadamard finite-part integrals \[ \int^1_{-1} \{\omega(t) f(t)/(t- x)^2\}\,dt. \] The function \(f\) is interpolated by using a finite sum of Chebyshev polynomials. The scheme used in this paper gives uniform approximations, namely the errors are bounded independently of \(x\), and is quite efficient for smooth \(f\). Further the approximation of hyper-singular integrals \[ \int^1_{-1} \{\omega(t) f(t)/(t- x)^n\}\,dt,\quad n\geq 3 \] and uniform convergence are discussed. Numerical examples are also given to demonstrate the performance of the present scheme.
    0 references
    quadrature rule
    0 references
    Hilbert transform
    0 references
    end-point singularities of Jacobi type
    0 references
    Chebyshev interpolation
    0 references
    algorithm
    0 references
    Cauchy principal value integral
    0 references
    Hadamard finite-part integrals
    0 references
    hyper-singular integrals
    0 references
    numerical examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references