When Not to Use an Automatic Quadrature Routine

DOI10.1137/1025003MaRDI QIDQ4746720zbMATH OpenOpenAlexFDO

Authors James N. Lyness

Publication date 1983

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1025003

zbMATH Keywords

automatic quadrature routineeconomygeneric propertiesperformance profile propertyreliability

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Computer aspects of numerical algorithms (65Y99)

Cited in

(16)

• Practical error estimation in numerical integration
• A discussion of a new error estimate for adaptive quadrature
• Testing automatic quadrature programs
• On the computation of Fourier transforms of singular functions
• Bibliography on the evaluation of numerical software
• Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems
• A simple, efficient and more reliable scheme for automatic numerical integration
• On optimal adaptive quadratures for automatic integration
• The cost of deterministic, adaptive, automatic algorithms: cones, not balls
• Adaptive change of basis in entropy-based moment closures for linear kinetic equations
• Automatic integration using asymptotically optimal adaptive simpson quadrature
• A program to generate a basis set adaptive radial quadrature grid for density functional theory
• Adaptive mesh point selection for the efficient solution of scalar IVPs
• Adaptive RBF cubature by scattered data on spherical polygons
• Numerical integration of functions with a sharp peak at or near one boundary using Möbius transformations
• MATLAB program for quadrature in 2D

This page was built for publication: When Not to Use an Automatic Quadrature Routine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4746720)