Abstract
An approximation of Clenshaw–Curtis type is given for Cauchy principal value integrals of logarithmically singular functions I(f;c)=−∫−11f(x) (log|x−c|)∕(x−c)dx (c∈(−1,1)) with a given function f. Using a polynomial pN of degree N interpolating f at the Chebyshev nodes we obtain an approximation I(pN;c)≅I(f;c). We expand pN in terms of Chebyshev polynomials with O(NlogN) computations by using the fast Fourier transform. Our method is efficient for smooth functions f, for which pN converges to f fast as N grows, and so simple to implement. This is achieved by exploiting three-term inhomogeneous recurrence relations in three stages to evaluate I(pN;c). For f(z) analytic on the interval [−1,1] in the complex plane z, the error of the approximation I(pN;c) is shown to be bounded uniformly. Using numerical examples we demonstrate the performance of the present method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.