627 research outputs found

    GPU-accelerated discontinuous Galerkin methods on hybrid meshes

    Full text link
    We present a time-explicit discontinuous Galerkin (DG) solver for the time-domain acoustic wave equation on hybrid meshes containing vertex-mapped hexahedral, wedge, pyramidal and tetrahedral elements. Discretely energy-stable formulations are presented for both Gauss-Legendre and Gauss-Legendre-Lobatto (Spectral Element) nodal bases for the hexahedron. Stable timestep restrictions for hybrid meshes are derived by bounding the spectral radius of the DG operator using order-dependent constants in trace and Markov inequalities. Computational efficiency is achieved under a combination of element-specific kernels (including new quadrature-free operators for the pyramid), multi-rate timestepping, and acceleration using Graphics Processing Units.Comment: Submitted to CMAM

    Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

    Full text link
    In this paper, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O(p2d)\mathcal{O}(p^{2d}) storage and O(p3d)\mathcal{O}(p^{3d}) computational work, where pp is the degree of basis polynomials used, and dd is the spatial dimension. Our SVD-based tensor-product preconditioner requires O(pd+1)\mathcal{O}(p^{d+1}) storage, O(pd+1)\mathcal{O}(p^{d+1}) work in two spatial dimensions, and O(pd+2)\mathcal{O}(p^{d+2}) work in three spatial dimensions. Combined with a matrix-free Newton-Krylov solver, these preconditioners allow for the solution of DG systems in linear time in pp per degree of freedom in 2D, and reduce the computational complexity from O(p9)\mathcal{O}(p^9) to O(p5)\mathcal{O}(p^5) in 3D. Numerical results are shown in 2D and 3D for the advection and Euler equations, using polynomials of degree up to p=15p=15. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees pp.Comment: 40 pages, 15 figure

    IgA-BEM for 3D Helmholtz problems using conforming and non-conforming multi-patch discretizations and B-spline tailored numerical integration

    Get PDF
    An Isogeometric Boundary Element Method (IgA-BEM) is considered for the numerical solution of Helmholtz problems on 3D bounded or unbounded domains, admitting a smooth multi-patch representation of their finite boundary surface. The discretization spaces are formed by C0 inter-patch continuous functional spaces whose restriction to a patch simplifies to the span of tensor product B-splines composed with the given patch NURBS parameterization. Both conforming and non-conforming spaces are allowed, so that local refinement is possible at the patch level. For regular and singular integration, the proposed model utilizes a numerical procedure defined on the support of each trial B-spline function, which makes possible a function-by-function implementation of the matrix assembly phase. Spline quasi-interpolation is the common ingredient of all the considered quadrature rules; in the singular case it is combined with a B-spline recursion over the spline degree and with a singularity extraction technique, extended to the multi-patch setting for the first time. A threshold selection strategy is proposed to automatically distinguish between nearly singular and regular integrals. The non-conforming C0 joints between spline spaces on different patches are implemented as linear constraints based on knot removal conditions, and do not require a hierarchical master-slave relation between neighbouring patches. Numerical examples on relevant benchmarks show that the expected convergence orders are achieved with uniform discretization and a small number of uniformly spaced quadrature nodes

    New hybrid quadrature schemes for weakly singular kernels applied to isogeometric boundary elements for 3D Stokes flow

    Full text link
    This work proposes four novel hybrid quadrature schemes for the efficient and accurate evaluation of weakly singular boundary integrals (1/r kernel) on arbitrary smooth surfaces. Such integrals appear in boundary element analysis for several partial differential equations including the Stokes equation for viscous flow and the Helmholtz equation for acoustics. The proposed quadrature schemes apply a Duffy transform-based quadrature rule to surface elements containing the singularity and classical Gaussian quadrature to the remaining elements. Two of the four schemes additionally consider a special treatment for elements near to the singularity, where refined Gaussian quadrature and a new moment-fitting quadrature rule are used. The hybrid quadrature schemes are systematically studied on flat B-spline patches and on NURBS spheres considering two different sphere discretizations: An exact single-patch sphere with degenerate control points at the poles and an approximate discretization that consist of six patches with regular elements. The efficiency of the quadrature schemes is further demonstrated in boundary element analysis for Stokes flow, where steady problems with rotating and translating curved objects are investigated in convergence studies for both, mesh and quadrature refinement. Much higher convergence rates are observed for the proposed new schemes in comparison to classical schemes
    • …
    corecore