On the complexity of self-validating numerical integration and approximation of functions with singularities

DOI10.1006/jcom.1998.0478zbMath0924.65016OpenAlexW1997760371MaRDI QIDQ1273730

Knut Petras

Publication date: 2 November 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ba4384f414c51360887ad4b392649eea6e09481e

zbMATH Keywords

complexityautomatic differentiationinterval arithmeticquadraturefunctions with singularitiesself-correcting algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Interval and finite arithmetic (65G30) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

A class of noninjective circle transformations without periodic points ⋮ Set-Membership Computation of Integrals with Uncertain Endpoints ⋮ On the Petras algorithm for verified integration of piecewise analytic functions ⋮ Self-validating integration and approximation of piecewise analytic functions

Cites Work

• Automatic differentiation: techniques and applications
• Numerical integration on advanced computer systems
• Adaptive, Self-Validating Numerical Quadrature
• On the Power of Adaptive Information for Functions with Singularities
• Some basic information on information-based complexity theory
• Perspectives on information-based complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of self-validating numerical integration and approximation of functions with singularities