Article ID Journal Published Year Pages File Type
471412 Computers & Mathematics with Applications 2013 19 Pages PDF
Abstract

We introduce and analyze a family of algorithms for an efficient numerical approximation of integrals of the form I=∫C(1)∫C(2)F(x,y,y−x)dydxI=∫C(1)∫C(2)F(x,y,y−x)dydx where C(1)C(1), C(2)C(2) are dd-dimensional parallelotopes (i.e. affine images of dd-hypercubes) and FF has a singularity at y−x=0y−x=0. Such integrals appear in Galerkin discretization of integral operators in RdRd. We construct a family of quadrature rules QNQN with NN function evaluations for a class of integrands FF which may have algebraic singularities at y−x=0y−x=0 and are Gevrey-δδ regular for y−x≠0y−x≠0. The main tool is an explicit regularizing coordinate transformation, simultaneously simplifying the singular support and the domain of integration. For the full tensor product variant of the suggested quadrature family we prove that QNQN achieves the exponential convergence rate O(exp(−rNγ))O(exp(−rNγ)) with the exponent γ=1/(2dδ+1)γ=1/(2dδ+1). In the special case of a singularity of the form ‖y−x‖α‖y−x‖α with real αα we prove that the improved convergence rate of γ=1/(2dδ)γ=1/(2dδ) is achieved if a certain modified one-dimensional Gauss–Jacobi quadrature rule is used in the singular direction. We give numerical results for various types of the quadrature rules, in particular based on tensor product rules, standard (Smolyak), optimized and adaptive sparse grid quadratures and Sobol’ sequences.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,