Automatic integration using asymptotically optimal adaptive simpson quadrature
DOI10.1007/S00211-014-0684-3zbMATH Open1326.65035DBLPjournals/nm/Plaskota15OpenAlexW2053354511WikidataQ33731151 ScholiaQ33731151MaRDI QIDQ495532FDOQ495532
Authors: Leszek Plaskota 
Publication date: 14 September 2015
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-014-0684-3
Recommendations
- On optimal adaptive quadratures for automatic integration
- Asymptotic behavior of automatic quadrature
- Algorithm 691: Improving QUADPACK automatic integration routines
- Adaption allows efficient integration of functions with unknown singularities
- A discussion of a new error estimate for adaptive quadrature
Complexity and performance of numerical algorithms (65Y20) Numerical quadrature and cubature formulas (65D32) Approximate quadratures (41A55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Noisy Information and Computational Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of Gauss-Kronrod quadrature rules
- Title not available (Why is that?)
- Notes on the Adaptive Simpson Quadrature Routine
- Adaptive quadrature -- Revisited
- When Not to Use an Automatic Quadrature Routine
- Adaption allows efficient integration of functions with unknown singularities
- On the power of adaption
- Average case optimality
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- Local Versus Global Strategies for Adaptive Quadrature
- Introduction to theory of control in organizations
Cited In (13)
- An adaptive numerical quadrature algorithm of computing with both changeable step and changeable order
- Local adaption for approximation and minimization of univariate functions
- An adaptive quadrature-based factorization method for inverse acoustic scattering problems
- Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis
- Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems
- On a certain adaptive method of approximate integration and its stopping criterion
- Title not available (Why is that?)
- A simple, efficient and more reliable scheme for automatic numerical integration
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- Automatic approximation using asymptotically optimal adaptive interpolation
- On optimal adaptive quadratures for automatic integration
- An adaptive numerical integration algorithm with automatic result verification for definite integrals
- Adaptive mesh point selection for the efficient solution of scalar IVPs
Uses Software
This page was built for publication: Automatic integration using asymptotically optimal adaptive simpson quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495532)
