When Not to Use an Automatic Quadrature Routine
From MaRDI portal
Publication:4746720
DOI10.1137/1025003zbMath0508.65006OpenAlexW2006677629MaRDI QIDQ4746720
Publication date: 1983
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1025003
Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Computer aspects of numerical algorithms (65Y99)
Related Items (15)
Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems ⋮ Adaptive change of basis in entropy-based moment closures for linear kinetic equations ⋮ A discussion of a new error estimate for adaptive quadrature ⋮ A program to generate a basis set adaptive radial quadrature grid for density functional theory ⋮ A simple, efficient and more reliable scheme for automatic numerical integration ⋮ Numerical integration of functions with a sharp peak at or near one boundary using Möbius transformations ⋮ Testing automatic quadrature programs ⋮ MATLAB program for quadrature in 2D ⋮ Automatic integration using asymptotically optimal adaptive simpson quadrature ⋮ Adaptive mesh point selection for the efficient solution of scalar IVPs ⋮ On the computation of Fourier transforms of singular functions ⋮ The cost of deterministic, adaptive, automatic algorithms: cones, not balls ⋮ On optimal adaptive quadratures for automatic integration ⋮ Bibliography on the evaluation of numerical software ⋮ Practical error estimation in numerical integration
This page was built for publication: When Not to Use an Automatic Quadrature Routine