English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The Clenshaw-Curtis method for numerical integration is extended to semi-infinite ([0, ∞] and infinite [-&#x221E;, ∞] intervals. The common framework for both these extensions and for integration on a finite interval is to (1) map the integration domain to l ε [0, π ], (2) compute a Fourier sine or cosine approximation to the transformd integrand via interpolation, and (3) integrate the approximation. The interpolation is most easily performed via the sine or cosine cardinal functions, which are discussed in the appendix. The algorithm is mathematically equivalent to expanding the integrand in (mapped or unmapped) Chebyshev polynomials as done by Clenshaw and Curtis, but the trigonometric approach simplifies the mechanics. Like Gaussian quadrature, the error for the change-of-coordinates Fourier method decreases exponentially with N , the number of grid points, but the generalized Curtis-Clenshaw algorithm is much easier to program than Gaussian quadrature because the abscissas and weights are given by simple, explicit formulas

Exponentially convergent Fourier-Chebshev quadrature schemes on bounded and infinite intervals