On the complexity of self-validating numerical integration and approximation of functions with singularities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3574878 (Why is no real title available?)
- scientific article; zbMATH DE number 3802727 (Why is no real title available?)
- scientific article; zbMATH DE number 3247704 (Why is no real title available?)
- Adaptive, Self-Validating Numerical Quadrature
- Automatic differentiation: techniques and applications
- Numerical integration on advanced computer systems
- On the Power of Adaptive Information for Functions with Singularities
- Perspectives on information-based complexity
- Some basic information on information-based complexity theory
Cited in
(7)- A class of noninjective circle transformations without periodic points
- Self-validating integration and approximation of piecewise analytic functions
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- scientific article; zbMATH DE number 1393414 (Why is no real title available?)
- Set-Membership Computation of Integrals with Uncertain Endpoints
- scientific article; zbMATH DE number 3921808 (Why is no real title available?)
- On the Petras algorithm for verified integration of piecewise analytic functions
This page was built for publication: On the complexity of self-validating numerical integration and approximation of functions with singularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273730)