summation paths in clenshaw-curtis quadrature

Clicks: 88
ID: 225913
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #439 of 625 articles by views in utilitas mathematica

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 625 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Two topics concerning the use of Clenshaw-Curtis quadrature within the Bayesian automatic adaptive quadrature approach to the numerical solution of Riemann integrals are considered. First, it is found that the efficient floating point computation of the coefficients of the Chebyshev series expansion of the integrand is to be done within a mathematical structure consisting of the union of coefficient families ordered into complete binary trees. Second, the scrutiny of the decay rates of the involved even and odd rank Chebyshev expansion coefficients with the increase of their rank labels enables the definition of Bayesian decision paths for the advancement to the numerical output.
Reference Key
s.2016epjsummation Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Adam S.;Adam Gh.
Journal utilitas mathematica
Year 2016
DOI
10.1051/epjconf/201610802003
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.