ESAIM Mathematical Modelling and Numerical Analysis · 2010 · 36 citations · 13 references
ComputingComputer ScienceComputational GeometryComputational PhysicsScientific ComputingConvergence AnalysisIntegral EquationsNumerical AlgorithmsNumerical AnalysisNumerical IntegrationNumerical Methods For Differential EquationsConvergenceGalerkin DiscretizationQuadrature OperatorsQuadrature RulesQuadrature TheorySingular Integral EvaluationSingular Integral OperatorsSingularities
Galerkin discretizations of integral equations in require the evaluation of integrals where S(1),S(2) are d-simplices and g has a singularity at x = y. We assume that g is Gevrey smooth for x y and satisfies bounds for the derivatives which allow algebraic singularities at x = y. This holds for kernel functions commonly occurring in integral equations. We construct a family of quadrature rules using N function evaluations of g which achieves exponential convergence |I – | ≤ C exp(–rNγ) with constants r, γ > 0.
13
Is Gauss Quadrature Better than Clenshaw–Curtis?
Lloyd N. Trefethen · SIAM Review · 2008 · 631 citations