Adaptive cubature over a collection of triangles using the \(d\)- transformation (Q1334760): Difference between revisions

The authors describe an automatic routine to integrate a function over a collection of triangles where on each triangle the function is well behaved, or has singularities at one or more vertices or edges. The algorithm is globally adaptive. Based on the behaviour of the cubature sums over a triangle selected for processing, the algorithm either advances extrapolation by one stage or divides the triangle into four similar subtriangles. The algorithm essentially uses the so-called \(d\)- transformation investigated by \textit{D. Levin} and \textit{A. Sidi} [Appl. Math. Comput. 9, 175-215 (1981; Zbl 0487.65003)]. The paper includes test results for functions with algebraic or logarithmic singularities at vertices or edges of the triangles. From such performance testings the authors can summarize that in these cases their routine is superior to other published routines. On the other hand, for more smooth functions higher degree rules seem to be more efficient.