Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1907.01397

A conforming discontinuous Galerkin finite element method: Part II

Xiu Ye·Shangyou Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

A conforming discontinuous Galerkin (DG) finite element method has been introduced in [21] on simplicial meshes, which has the flexibility of using discontinuous approximation and the simplicity in formulation of the classic continuous finite element method. The goal of this paper is to extend the conforming DG finite element method in \cite{cdg1} so that it can work on general polytopal meshes by designing weak gradient $\nabla_w$ appropriately. Two different conforming DG formulations on polytopal meshes are introduced which handle boundary conditions differently. Error estimates of optimal order are established for the corresponding conforming DG approximation in both a discrete $H^1$ norm and the $L^2$ norm. Numerical results are presented to confirm the theory.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiu Ye, Shangyou Zhang. 2019-07-10. A conforming discontinuous Galerkin finite element method: Part II. https://arxiv.org/abs/1907.01397

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Collect, Commit, Expand: Efficient CPQR-Based Column Selection for Extremely Wide Matrices

Column-pivoted QR (CPQR) factorization is a computational primitive used in numerous applications that require selecting a small set of "representative" columns from a much larger matrix. These include applications in spectral clustering, model-order reduction, low-rank approximation, and computational quantum chemistry, where the matrix being factorized has a moderate number of rows but an extremely large number of columns. We describe a modification of the Golub-Businger algorithm which, for many matrices of this type, can perform CPQR-based column selection much more efficiently. This algorithm, which we call CCEQR, is based on a three-step "collect, commit, expand" strategy that limits the number of columns being manipulated, while also transferring more computational effort from level-2 BLAS to level-3. Unlike most CPQR algorithms that exploit level-3 BLAS, CCEQR is deterministic, and provably recovers a column permutation equivalent to the one computed by the Golub-Businger algorithm. Tests on spectral clustering and Wannier basis localization problems demonstrate that on appropriately structured problems, CCEQR can significantly outperform GEQP3.

math.NA↗
arXiv2026

Spectral element methods for boundary-value problems of functional differential equations

We prove convergence of the spectral element method for piecewise polynomial collocation applied to periodic boundary value problems for functional differential equations. In particular, we prove that the numerical collocation solution approximates the true solution with accuracy of order $\mathrm{e}^{-ηm}$ for some $η>0$ and increasing degree $m$ of the polynomials, provided that the true solution is analytical. This includes a case that is common in applications: differential equations where the right-hand side depends on a finite number of delayed arguments with parametric delays and real analytic coefficients. For state-dependent delays the spectral element method also converges under mild regularity assumptions, although analyticity of the solution cannot be trivially inferred from analyticity of the coefficients. In order to extend our convergence results to this case, we introduce the concept of extended local Lipschitz continuity of the right-hand side.

math.NA↗
arXiv2026

A Multi-Frequency Helmholtz Solver Based on the WaveHoltz Algorithm

We develop and analyze a new approach for simultaneously computing multiple solutions to the Helmholtz equation for different frequencies and different forcing functions. The new Multi-Frequency WaveHoltz (MFWH) algorithm is an extension of the original WaveHoltz method and both are based on time-filtering solutions to an associated wave equation. With MFWH, the different Helmholtz solutions are computed simultaneously by solving a single wave equation combined with multiple time filters. The MFWH algorithm defines a fixed-point iteration which can be accelerated with Krylov methods such as GMRES. The solution of the wave equation can be efficiently solved with either explicit time-stepping or implicit time-stepping using as few as five time-steps per period. When combined with an $O(N)$ solver for the implicit equations, such a multigrid, the scheme has an $O(N)$ solution cost when the frequencies are fixed and the number of grid points $N$ increases. High-order accurate approximations in space are used together with second-order accurate approximations in time. We show how to remove time discretization errors so that the MFWH solutions converge to the corresponding solutions to the discretized Helmholtz problems. Numerical results are given using second-order accurate and fourth-accurate discretizations to confirm the convergence theory.

math.NA↗