Error estimation in automatic quadrature routines
ACM Transactions on Mathematical Software (TOMS)
Fundamentals of numerical computing
Fundamentals of numerical computing
Is Gauss Quadrature Better than Clenshaw-Curtis?
SIAM Review
Weighted quadrature by change of variable
Neural, Parallel & Scientific Computations
Robust Gaussian Process Regression with a Student-t Likelihood
The Journal of Machine Learning Research
Simulation of axi-symmetric flow towards wells: A finite-difference approach
Computers & Geosciences
A review of error estimation in adaptive quadrature
ACM Computing Surveys (CSUR)
Algorithm 935: IIPBF, a MATLAB toolbox for infinite integral of products of two Bessel functions
ACM Transactions on Mathematical Software (TOMS)
Gauss-Jacobi-type quadrature rules for fractional directional integrals
Computers & Mathematics with Applications
Computers & Mathematics with Applications
Hi-index | 7.30 |
Adaptive quadrature codes process a collection of subintervals one at a time. We show how to process them all simultaneously and so exploit vectorization and the use of fast built-in functions and array operations that are so important to efficient computation in MATLAB. Using algebraic transformations we have made it just as easy for users to solve problems on infinite intervals and with moderate end point singularities as problems with finite intervals and smooth integrands. Piecewise-smooth integrands are handled effectively with breakpoints.