Increasing the Reliability of Adaptive Quadrature Using Explicit Interpolants
arXiv:1006.3962 · doi:10.1145/1824801.1824804
Abstract
We present two new adaptive quadrature routines. Both routines differ from previously published algorithms in many aspects, most significantly in how they represent the integrand, how they treat non-numerical values of the integrand, how they deal with improper divergent integrals and how they estimate the integration error. The main focus of these improvements is to increase the reliability of the algorithms without significantly impacting their efficiency. Both algorithms are implemented in Matlab and tested using both the "families" suggested by Lyness and Kaganove and the battery test used by Gander and Gautschi and Kahaner. They are shown to be more reliable, albeit in some cases less efficient, than other commonly-used adaptive integrators.
32 pages, submitted to ACM Transactions on Mathematical Software
Cited by in corpus (8)
- Learning Feynman Diagrams with Tensor Trains
- Tkwant: a software package for time-dependent quantum transport
- Roundoff errors in the problem of computing Cauchy principal value integrals
- Effects of electronic correlations and magnetic field on a molecular ring out of equilibrium
- Probing phase coherence via density of states for strongly correlated excitons
- Phase coherence and spectral functions in the two-dimensional excitonic systems
- AMGKQ: An Efficient Implementation of Adaptive Multivariate Gauss-Kronrod Quadrature for Simultaneous Integrands in Octave/MATLAB
- Two band model for coherent excitonic condensates