Fast and stable computation of highly oscillatory and/or exponentially decaying integrals using a Clenshaw-Curtis product-integration rule

We propose, analyze, and implement a quadrature method for evaluating integrals of the form $$\int _0^2 f(s)\exp (zs)\, \textrm{d}s$$ , where z is a complex number with a possibly large negative real part. The integrand may exhibit exponential decay, highly oscillatory behavior, or both simultaneously, making standard quadrature rules computationally expensive. Our approach is based on a Clenshaw-Curtis product-integration rule: the smooth part of the integrand is interpolated using a polynomial at Chebyshev nodes, and the resulting integral is computed exactly. We analyze the convergence of the method with respect to both the number of nodes and the parameter z. Additionally, we provide a stable and efficient implementation whose computational cost is essentially independent of z and scales linearly with the number of Chebyshev nodes. Notably, our approach avoids the use of special functions, enhancing its numerical robustness.

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2026-03-17
DOI
https://doi.org/10.1007/s11075-026-02333-8
Primary Topic
Mathematical functions and polynomials
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast and stable computation of highly oscillatory and/or exponentially decaying integrals using a Clenshaw-Curtis product-integration rule

Numerical Algorithms
Mathematical functions and polynomials
article

Fast and stable computation of highly oscillatory and/or exponentially decaying integrals using a Clenshaw-Curtis product-integration rule

article en

Abstract

We propose, analyze, and implement a quadrature method for evaluating integrals of the form $$\int _0^2 f(s)\exp (zs)\, \textrm{d}s$$ , where z is a complex number with a possibly large negative real part. The integrand may exhibit exponential decay, highly oscillatory behavior, or both simultaneously, making standard quadrature rules computationally expensive. Our approach is based on a Clenshaw-Curtis product-integration rule: the smooth part of the integrand is interpolated using a polynomial at Chebyshev nodes, and the resulting integral is computed exactly. We analyze the convergence of the method with respect to both the number of nodes and the parameter z. Additionally, we provide a stable and efficient implementation whose computational cost is essentially independent of z and scales linearly with the number of Chebyshev nodes. Notably, our approach avoids the use of special functions, enhancing its numerical robustness.

Numerical Algorithms
Universidad Pública de Navarra (UPNA) (ES)
Openalex Percentile: Top 16%
Mathematical functions and polynomials
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fast and stable computation of highly oscillatory and/or exponentially decaying integrals using a Clenshaw-Curtis product-integration rule · Numerical Algorithms (2026) | TGRS Research Map | TGRS