Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1910.04585

$P_1$--nonconforming polyhedral finite elements in high dimensions

Dongwoo Sheen
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the lowest--degree nonconforming finite element methods for the approximation of elliptic problems in high dimensions. The $P_1$--nonconforming polyhedral finite element is introduced for any high dimension. Our finite element is simple and cheap as it is based on the triangulation of domains into parallelotes, which are combinatorially equivalent to $d$--dimensional cube, rather than the triangulation of domains into simplices. Our nonconforming element is nonparametric, and on each polytope it contains only linear polynomials, but it is sufficient to give optimal order convergence for second--order elliptic problems.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongwoo Sheen. 2020-02-04. $P_1$--nonconforming polyhedral finite elements in high dimensions. https://arxiv.org/abs/1910.04585

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

KEEP EXPLORING

Related papers

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↗
arXiv2026

A Geometrical Acoustics based Focusing Algorithm for Layered Media in Medical Ultrasound

Ultrasound imaging is a widely used, non-invasive diagnostic tool in modern medicine. A crucial assumption is a constant sound speed in the observed medium. For large scale sound speed variations, this assumption leads to blurred and distorted images. In this paper, we present a Geometrical Acoustics Focusing Algorithm (GEOFA) which is able to correct for these aberrations, given a known layered medium setting with continuously differentiable medium boundaries. Existence and uniqueness conditions for a solution to the underlying system of equations are given. Using numerical simulations, the precision of our method is evaluated. Finally, the resulting image quality improvements are demonstrated in a phantom-based experimental setup.

math.NA↗
arXiv2026

Reducing Training Complexity in Empirical Quadrature-Based Model Reduction via Structured Compression

Model order reduction seeks to approximate large-scale dynamical systems by lower-dimensional reduced models. For linear systems, a small reduced dimension directly translates into low computational cost, ensuring online efficiency. This property does not generally hold for nonlinear systems, where an additional approximation of nonlinear terms --known as complexity reduction-- is required. To achieve online efficiency, empirical quadrature and cell-based empirical cubature are among the most effective complexity reduction techniques. However, the offline training of these methods operates on a matrix whose dimension scales with both the snapshot count and the reduced model dimension, and can become a computational bottleneck at larger scale. Existing strategies such as parallelization and randomized linear algebra reduce the cost of processing this matrix but do not reduce its dimension. In this paper, we introduce a preprocessing approach based on a specific structured compression of the training data. Crucially, our approach ensures that no operation scales concurrently with the snapshot count, the reduced model dimension, and the problem dimension. Overall, this yields roughly an order-of-magnitude reduction in offline computational cost and memory requirements, thereby enabling the application of the complexity reduction methods to larger-scale problems. Accuracy is preserved, as indicated by our error analysis and demonstrated through numerical examples.

math.NA↗