SearcharxivSearch

arXiv · 2609.05849

Efficient $C^1$ Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems

Abstract

We develop an efficient $C^1$ Bernstein quasi-Trefftz discretization for heterogeneous high-frequency Helmholtz problems on unstructured triangular meshes. The method first imposes strong $C^1$ continuity through Bernstein--Bézier smoothness relations on local macro-patches and then reduces the resulting conforming polynomial space by enforcing projected Helmholtz residual constraints. On two-triangle patches, this compresses the local dimension from quadratic growth in the polynomial degree to a trace-sized space of dimension $2p+1$ under the natural rank condition. Variable matrix-valued coefficients are handled through local polynomial projection, allowing coefficient-approximation effects to be separated from discretization error. A graph-residual formulation couples the reduced patch spaces and produces a sparse global system in compressed coordinates. The implementation combines explicit $C^1$ continuation, batched coefficient projection, batched residual construction, and stable local kernel extraction by QR factorization. Numerical experiments on heterogeneous unstructured meshes demonstrate high-order accuracy, roundoff-level $C^1$ conformity, robust high-frequency resolution, and substantial reductions in local and global computational cost. Turning-point and penetrable-scattering examples further illustrate the flexibility of the approach.

Explore related subjects

Keep this discovery

BibTeXRIS

Shelvean Kapita. 2026-09-05. Efficient $C^1$ Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems. https://arxiv.org/abs/2609.05849

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA