Adaptive quadratures over volumes (Q1180343)

From MaRDI portal





scientific article; zbMATH DE number 25659
Language Label Description Also known as
English
Adaptive quadratures over volumes
scientific article; zbMATH DE number 25659

    Statements

    Adaptive quadratures over volumes (English)
    0 references
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    An adaptive extrapolative quadrature algorithm is presented for approximation of volume integrals \(\int_ Df dx\) over a region \(D\) in \(\mathbb{R}^ 3\) with piecewise smooth boundary. \(f(x)\) may have a weak singularity inside \(D\). The algorithm uses the Coxeter-Freudenthal triangulation method to subdivide \(D\). Briefly the procedure is the following: Having generated a subdivision (tetrahedron) \(\sigma\) in \(D\) the algorithm either (i) generates \(\int_ \sigma f dx\) to within a prescribed tolerance and advances to the next subdivision or (ii) partitions \(\sigma\) into smaller tetrahedrons by halving the edges and applies (i), (ii) to these new subdivisions. Procedure (i) involves an extrapolation using a Romberg extrapolation tableaux and it employs different quadrature formulas depending on how many of the vertices of the tetrahedron cross the boundary of \(D\). Numerical results are given for several test problems obtained with a program written in Turbo-C and run on a PC with 80386/387 processors. A high degree of accuracy was obtained.
    0 references
    boundary integral method
    0 references
    quadrature formula
    0 references
    trapezoidal rule
    0 references
    adaptive extrapolative quadrature algorithm
    0 references
    volume integrals
    0 references
    weak singularity
    0 references
    Coxeter-Freudenthal triangulation method
    0 references
    Romberg extrapolation
    0 references
    Numerical results
    0 references
    test problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references