An adaptive variable order quadrature strategy
From MaRDI portal
Publication:1696705
DOI10.1007/978-3-319-65870-4_38zbMATH Open1382.65069arXiv1508.03516OpenAlexW3037461666MaRDI QIDQ1696705FDOQ1696705
Authors: Paul Houston, Thomas P. Wihler 
Publication date: 15 February 2018
Abstract: In this article we propose a new adaptive numerical quadrature procedure which includes both local subdivision of the integration domain, as well as local variation of the number of quadrature points employed on each subinterval. In this way we aim to account for local smoothness properties of the function to be integrated as effectively as possible, and thereby achieve highly accurate results in a very efficient manner. Indeed, this idea originates from so-called hp-version finite element methods which are known to deliver high-order convergence rates, even for nonsmooth functions.
Full work available at URL: https://arxiv.org/abs/1508.03516
Recommendations
- On optimal adaptive quadratures for automatic integration
- On the subdivision strategy in adaptive quadrature algorithms
- An adaptive numerical quadrature algorithm of computing with both changeable step and changeable order
- scientific article; zbMATH DE number 3881766
- Variable order composite quadrature of singular and nearly singular integrals
Cited In (6)
- An adaptive numerical quadrature algorithm of computing with both changeable step and changeable order
- Floating point degree of precision of an interpolatory quadrature sum
- On the construction of high-order integration formulae for the adaptive quadrature method
- A generalized quartic quadrature based adaptive scheme
- Order adaptive integration rule with equivalently weighted internal nodes
- Order Adaptive Quadrature Rule for Real Time Holography Applications
This page was built for publication: An adaptive variable order quadrature strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696705)
