Construction of fully symmetric cubature formulae of degree 4k-3 for fully symmetric planar regions
Journal of Computational and Applied Mathematics - Numerical Quadrature
The accuracy of floating point summation
SIAM Journal on Scientific Computing
Algorithm 719: Multiprecision translation and execution of FORTRAN programs
ACM Transactions on Mathematical Software (TOMS)
An adaptive algorithm for the approximate calculation of multiple integrals
ACM Transactions on Mathematical Software (TOMS)
Algorithm 764: Cubpack++: a C++ package for automatic two-dimensional cubature
ACM Transactions on Mathematical Software (TOMS)
d2lri: a nonadaptive algorithm for two-dimensional cubature
Journal of Computational and Applied Mathematics - Numerical evaluation of integrals
On the implementation of a modified Sag-Szekeres quadrature method
Journal of Computational and Applied Mathematics - Numerical evaluation of integrals
Pracniques: further remarks on reducing truncation errors
Communications of the ACM
Numerical Computation, Volume I
Numerical Computation, Volume I
The index of merit of kth-copy integration lattices
Journal of Computational and Applied Mathematics
Journal of Scientific Computing
Further extension of a class of periodizing variable transformations for numerical integration
Journal of Computational and Applied Mathematics
The search for a good lattice augmentation sequence in three dimensions
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
ACM Transactions on Mathematical Software (TOMS)
plrint5d: a five-dimensional automatic cubature routine designed for a multi-core platform
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Hi-index | 0.00 |
r2d2lri is a non-adaptive algorithm implemented in C++ for performing automatic cubature over a wide variety of finite and non-finite two-dimensional domains. The core integrator uses a sixth-order Sidi transformation applied to a sequence of embedded lattice rules in such a fashion as to incur virtually no computational overhead. Even for integrals over non-finite domains, for which several non-finite to finite transformations may be attempted, the algorithm remains very fast. Performance data are presented which demonstrate both the effectiveness and efficiency of r2d2lri, taking into account the number of function evaluations needed and the execution speed.