Clenshaw–Curtis algorithms for an efficient numerical approximation of singular and highly oscillatory Fourier transform integrals

Simple item page
dc.contributor.authorKayijuka I.
dc.contributor.authorEge Ş.M.
dc.contributor.authorKonuralp A.
dc.contributor.authorTopal F.S.
dc.date.accessioned2024-07-22T08:06:09Z
dc.date.available2024-07-22T08:06:09Z
dc.date.issued2021
dc.description.abstractThis paper investigates the implementation of Clenshaw–Curtis algorithms on singular and highly oscillatory integrals for efficient evaluation of the finite Fourier-type transform of integrands with endpoint singularities. In these methods, integrands are truncated by orthogonal polynomials and special function series term by term. Then their singularity types are computed using third and fourth-order homogeneous recurrence relations. The first approach reveals its efficiency for low, moderate and very high frequencies, whereas the second one, is more efficient for small values of frequencies. Moreover, all the results were found quite satisfactory. Algorithms and programming code in MATHEMATICA® 9.0 are provided for the implementation of methods for automatic computation on a computer. Lastly, illustrative numerical experiments and comparison of the proposed Clenshaw–Curtis algorithms to the steepest descent method are mentioned in support of our theoretical analysis in the examples section. © 2020 Elsevier B.V.
dc.identifier.DOI-ID10.1016/j.cam.2020.113201
dc.identifier.issn03770427
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/13382
dc.language.isoEnglish
dc.publisherElsevier B.V.
dc.subjectComputer programming
dc.subjectOrthogonal functions
dc.subjectSteepest descent method
dc.subjectAutomatic computations
dc.subjectHighly oscillatory integrals
dc.subjectNumerical approximations
dc.subjectNumerical experiments
dc.subjectOrthogonal polynomial
dc.subjectRecurrence relations
dc.subjectSpecial functions
dc.subjectVery high frequency
dc.subjectNumerical methods
dc.titleClenshaw–Curtis algorithms for an efficient numerical approximation of singular and highly oscillatory Fourier transform integrals
dc.typeArticle

Files

Collections

Scopus Koleksiyonu