Automatic integration using asymptotically optimal adaptive simpson quadrature
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 996424 (Why is no real title available?)
- scientific article; zbMATH DE number 3854294 (Why is no real title available?)
- scientific article; zbMATH DE number 3782281 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 3802727 (Why is no real title available?)
- Adaption allows efficient integration of functions with unknown singularities
- Adaptive quadrature -- Revisited
- Average case optimality
- Computation of Gauss-Kronrod quadrature rules
- Introduction to theory of control in organizations
- Local Versus Global Strategies for Adaptive Quadrature
- Noisy Information and Computational Complexity
- Notes on the Adaptive Simpson Quadrature Routine
- On the power of adaption
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- When Not to Use an Automatic Quadrature Routine
Cited in
(13)- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- scientific article; zbMATH DE number 937005 (Why is no real title available?)
- A simple, efficient and more reliable scheme for automatic numerical integration
- Adaptive mesh point selection for the efficient solution of scalar IVPs
- 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
- An adaptive numerical integration algorithm with automatic result verification for definite integrals
- An adaptive numerical quadrature algorithm of computing with both changeable step and changeable order
- On a certain adaptive method of approximate integration and its stopping criterion
- Automatic approximation using asymptotically optimal adaptive interpolation
- On optimal adaptive quadratures for automatic integration
- Local adaption for approximation and minimization of univariate functions
- Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems
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)
